sqbaselib.cpp 39 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483
  1. /*
  2. see copyright notice in squirrel.h
  3. */
  4. #include "sqpcheader.h"
  5. #include "sqvm.h"
  6. #include "sqstring.h"
  7. #include "sqtable.h"
  8. #include "sqarray.h"
  9. #include "sqfuncproto.h"
  10. #include "sqclosure.h"
  11. #include "sqclass.h"
  12. #include <stdlib.h>
  13. #include <stdarg.h>
  14. #include <ctype.h>
  15. bool str2num(const SQChar *s,SQObjectPtr &res, SQInteger base=10)
  16. {
  17. SQChar *end;
  18. const SQChar *e = s;
  19. SQBool isfloat = SQFalse;
  20. SQChar c;
  21. while((c = *e) != _SC('\0'))
  22. {
  23. if(c == _SC('.') || c == _SC('E')|| c == _SC('e')) { //e and E is for scientific notation
  24. isfloat = SQTrue;
  25. break;
  26. }
  27. e++;
  28. }
  29. if(isfloat){
  30. SQFloat r = SQFloat(scstrtod(s,&end));
  31. if(s == end) return false;
  32. res = r;
  33. }
  34. else{
  35. SQInteger r = SQInteger(scstrtol(s,&end, base));
  36. if(s == end) return false;
  37. res = r;
  38. }
  39. return true;
  40. }
  41. static SQInteger base_dummy(HSQUIRRELVM v)
  42. {
  43. return 0;
  44. }
  45. #ifndef NO_GARBAGE_COLLECTOR
  46. static SQInteger base_collectgarbage(HSQUIRRELVM v)
  47. {
  48. sq_pushinteger(v, sq_collectgarbage(v));
  49. return 1;
  50. }
  51. static SQInteger base_resurectureachable(HSQUIRRELVM v)
  52. {
  53. sq_resurrectunreachable(v);
  54. return 1;
  55. }
  56. #endif
  57. static SQInteger base_getroottable(HSQUIRRELVM v)
  58. {
  59. v->Push(v->_roottable);
  60. return 1;
  61. }
  62. static SQInteger base_getconsttable(HSQUIRRELVM v)
  63. {
  64. v->Push(_ss(v)->_consts);
  65. return 1;
  66. }
  67. static SQInteger base_setroottable(HSQUIRRELVM v)
  68. {
  69. SQObjectPtr o = v->_roottable;
  70. if(SQ_FAILED(sq_setroottable(v))) return SQ_ERROR;
  71. v->Push(o);
  72. return 1;
  73. }
  74. static SQInteger base_setconsttable(HSQUIRRELVM v)
  75. {
  76. SQObjectPtr o = _ss(v)->_consts;
  77. if(SQ_FAILED(sq_setconsttable(v))) return SQ_ERROR;
  78. v->Push(o);
  79. return 1;
  80. }
  81. static SQInteger base_seterrorhandler(HSQUIRRELVM v)
  82. {
  83. sq_seterrorhandler(v);
  84. return 0;
  85. }
  86. static SQInteger base_setdebughook(HSQUIRRELVM v)
  87. {
  88. sq_setdebughook(v);
  89. return 0;
  90. }
  91. static SQInteger base_enabledebuginfo(HSQUIRRELVM v)
  92. {
  93. SQObjectPtr &o=stack_get(v,2);
  94. sq_enabledebuginfo(v,SQVM::IsFalse(o)?SQFalse:SQTrue);
  95. return 0;
  96. }
  97. static SQInteger __getcallstackinfos(HSQUIRRELVM v,SQInteger level)
  98. {
  99. SQStackInfos si;
  100. SQInteger seq = 0;
  101. const SQChar *name = NULL;
  102. if (SQ_SUCCEEDED(sq_stackinfos(v, level, &si)))
  103. {
  104. const SQChar *fn = _SC("unknown");
  105. const SQChar *src = _SC("unknown");
  106. if(si.funcname)fn = si.funcname;
  107. if(si.source)src = si.source;
  108. sq_newtable(v);
  109. sq_pushstring(v, _SC("func"), -1);
  110. sq_pushstring(v, fn, -1);
  111. sq_newslot(v, -3, SQFalse);
  112. sq_pushstring(v, _SC("src"), -1);
  113. sq_pushstring(v, src, -1);
  114. sq_newslot(v, -3, SQFalse);
  115. sq_pushstring(v, _SC("line"), -1);
  116. sq_pushinteger(v, si.line);
  117. sq_newslot(v, -3, SQFalse);
  118. sq_pushstring(v, _SC("locals"), -1);
  119. sq_newtable(v);
  120. seq=0;
  121. while ((name = sq_getlocal(v, level, seq))) {
  122. sq_pushstring(v, name, -1);
  123. sq_push(v, -2);
  124. sq_newslot(v, -4, SQFalse);
  125. sq_pop(v, 1);
  126. seq++;
  127. }
  128. sq_newslot(v, -3, SQFalse);
  129. return 1;
  130. }
  131. return 0;
  132. }
  133. static SQInteger base_getstackinfos(HSQUIRRELVM v)
  134. {
  135. SQInteger level;
  136. sq_getinteger(v, -1, &level);
  137. return __getcallstackinfos(v,level);
  138. }
  139. static SQInteger base_getstacktop(HSQUIRRELVM v)
  140. {
  141. sq_pushinteger(v, sq_getfulltop(v));
  142. return 1;
  143. }
  144. static SQInteger base_assert(HSQUIRRELVM v)
  145. {
  146. if(SQVM::IsFalse(stack_get(v,2))){
  147. return sq_throwerror(v,_SC("assertion failed"));
  148. }
  149. return 0;
  150. }
  151. static SQInteger get_slice_params(HSQUIRRELVM v,SQInteger &sidx,SQInteger &eidx,SQObjectPtr &o)
  152. {
  153. SQInteger top = sq_gettop(v);
  154. sidx=0;
  155. eidx=0;
  156. o=stack_get(v,1);
  157. SQObjectPtr &start=stack_get(v,2);
  158. if(type(start)!=OT_NULL && sq_isnumeric(start)){
  159. sidx=tointeger(start);
  160. }
  161. if(top>2){
  162. SQObjectPtr &end=stack_get(v,3);
  163. if(sq_isnumeric(end)){
  164. eidx=tointeger(end);
  165. }
  166. }
  167. else {
  168. eidx = sq_getsize(v,1);
  169. }
  170. return 1;
  171. }
  172. static SQInteger base_print1(HSQUIRRELVM v)
  173. {
  174. const SQChar *str;
  175. sq_tostring(v,2);
  176. sq_getstring(v,-1,&str);
  177. if(_ss(v)->_printfunc) _ss(v)->_printfunc(v,_SC("%s"),str);
  178. return 0;
  179. }
  180. static SQInteger base_print(HSQUIRRELVM v)
  181. {
  182. if(_ss(v)->_printfunc){
  183. SQPRINTFUNCTION sqprint = _ss(v)->_printfunc;
  184. const SQChar *str;
  185. SQInteger nargs=sq_gettop(v);
  186. for(int i=2; i<=nargs; ++i){
  187. if(i>2) sqprint(v,_SC("\t"));
  188. sq_tostring(v,i);
  189. sq_getstring(v,-1,&str);
  190. sqprint(v,_SC("%s"),str);
  191. sq_poptop(v); //remove converted string
  192. }
  193. sqprint(v,_SC("\n"));
  194. }
  195. return 0;
  196. }
  197. static SQInteger base_error(HSQUIRRELVM v)
  198. {
  199. const SQChar *str;
  200. sq_tostring(v,2);
  201. sq_getstring(v,-1,&str);
  202. if(_ss(v)->_errorfunc) _ss(v)->_errorfunc(v,_SC("%s"),str);
  203. return 0;
  204. }
  205. static SQInteger base_get_last_error(HSQUIRRELVM v)
  206. {
  207. sq_getlasterror(v);
  208. return 1;
  209. }
  210. static SQInteger base_compilestring(HSQUIRRELVM v)
  211. {
  212. SQInteger nargs=sq_gettop(v);
  213. const SQChar *src=NULL,*name=_SC("unnamedbuffer");
  214. SQInteger size;
  215. sq_getstring(v,2,&src);
  216. size=sq_getsize(v,2);
  217. if(nargs>2){
  218. sq_getstring(v,3,&name);
  219. }
  220. if(SQ_SUCCEEDED(sq_compilebuffer(v,src,size,name,SQFalse)))
  221. return 1;
  222. else
  223. return SQ_ERROR;
  224. }
  225. static SQInteger base_newthread(HSQUIRRELVM v)
  226. {
  227. SQObjectPtr &func = stack_get(v,2);
  228. SQInteger stksize = (_closure(func)->_function->_stacksize << 1) +2;
  229. HSQUIRRELVM newv = sq_newthread(v, (stksize < MIN_STACK_OVERHEAD + 2)? MIN_STACK_OVERHEAD + 2 : stksize);
  230. sq_move(newv,v,-2);
  231. return 1;
  232. }
  233. static SQInteger base_suspend(HSQUIRRELVM v)
  234. {
  235. return sq_suspendvm(v);
  236. }
  237. static SQInteger base_array(HSQUIRRELVM v)
  238. {
  239. SQArray *a;
  240. SQObject &size = stack_get(v,2);
  241. if(sq_gettop(v) > 2) {
  242. a = SQArray::Create(_ss(v),0);
  243. a->Resize(tointeger(size),stack_get(v,3));
  244. }
  245. else {
  246. a = SQArray::Create(_ss(v),tointeger(size));
  247. }
  248. v->Push(a);
  249. return 1;
  250. }
  251. static SQInteger base_type(HSQUIRRELVM v)
  252. {
  253. SQObjectPtr &o = stack_get(v,2);
  254. v->Push(SQString::Create(_ss(v),GetTypeName(o),-1));
  255. return 1;
  256. }
  257. static SQInteger base_callee(HSQUIRRELVM v)
  258. {
  259. if(v->_callsstacksize > 1)
  260. {
  261. v->Push(v->_callsstack[v->_callsstacksize - 2]._closure);
  262. return 1;
  263. }
  264. return sq_throwerror(v,_SC("no closure in the calls stack"));
  265. }
  266. /* macro to `unsign' a character */
  267. #define uchar(c) ((unsigned SQChar)(c))
  268. static SQInteger base_str_from_chars (HSQUIRRELVM v) {
  269. SQ_FUNC_VARS_NO_TOP(v);
  270. SQInteger n = sq_gettop(v); /* number of arguments */
  271. int i;
  272. SQChar *data = sq_getscratchpad(v, n);
  273. for (i=2; i<=n; ++i) {
  274. SQ_GET_INTEGER(v, i, c);
  275. if(uchar(c) != c){
  276. return sq_throwerror(v, "invalid value for parameter %d", i);
  277. }
  278. data[i-2] = uchar(c);
  279. }
  280. sq_pushstring(v, data, n-1);
  281. return 1;
  282. }
  283. static SQRegFunction base_funcs[]={
  284. //generic
  285. {_SC("seterrorhandler"),base_seterrorhandler,2, NULL},
  286. {_SC("setdebughook"),base_setdebughook,2, NULL},
  287. {_SC("enabledebuginfo"),base_enabledebuginfo,2, NULL},
  288. {_SC("getstackinfos"),base_getstackinfos,2, _SC(".n")},
  289. {_SC("getstacktop"),base_getstacktop,1, _SC(".")},
  290. {_SC("getroottable"),base_getroottable,1, NULL},
  291. {_SC("setroottable"),base_setroottable,2, NULL},
  292. {_SC("getconsttable"),base_getconsttable,1, NULL},
  293. {_SC("setconsttable"),base_setconsttable,2, NULL},
  294. {_SC("assert"),base_assert,2, NULL},
  295. {_SC("print1"),base_print1,2, NULL},
  296. {_SC("print"),base_print,-2, NULL},
  297. {_SC("error"),base_error,2, NULL},
  298. {_SC("get_last_error"),base_get_last_error,1, NULL},
  299. {_SC("compilestring"),base_compilestring,-2, _SC(".ss")},
  300. {_SC("newthread"),base_newthread,2, _SC(".c")},
  301. {_SC("suspend"),base_suspend,-1, NULL},
  302. {_SC("array"),base_array,-2, _SC(".n")},
  303. {_SC("type"),base_type,2, NULL},
  304. {_SC("callee"),base_callee,0,NULL},
  305. {_SC("dummy"),base_dummy,0,NULL},
  306. #ifndef NO_GARBAGE_COLLECTOR
  307. {_SC("collectgarbage"),base_collectgarbage,0, NULL},
  308. {_SC("resurrectunreachable"),base_resurectureachable,0, NULL},
  309. {_SC("str_from_chars"),base_str_from_chars,-2, _SC(".i")},
  310. #endif
  311. {0,0}
  312. };
  313. void sq_base_register(HSQUIRRELVM v)
  314. {
  315. SQInteger i=0;
  316. sq_pushroottable(v);
  317. while(base_funcs[i].name!=0) {
  318. sq_pushstring(v,base_funcs[i].name,-1);
  319. sq_newclosure(v,base_funcs[i].f,0);
  320. sq_setnativeclosurename(v,-1,base_funcs[i].name);
  321. sq_setparamscheck(v,base_funcs[i].nparamscheck,base_funcs[i].typemask);
  322. sq_newslot(v,-3, SQFalse);
  323. i++;
  324. }
  325. sq_pushstring(v,_SC("_versionnumber_"),-1);
  326. sq_pushinteger(v,SQUIRREL_VERSION_NUMBER);
  327. sq_newslot(v,-3, SQFalse);
  328. sq_pushstring(v,_SC("_version_"),-1);
  329. sq_pushstring(v,SQUIRREL_VERSION,-1);
  330. sq_newslot(v,-3, SQFalse);
  331. sq_pushstring(v,_SC("_charsize_"),-1);
  332. sq_pushinteger(v,sizeof(SQChar));
  333. sq_newslot(v,-3, SQFalse);
  334. sq_pushstring(v,_SC("_intsize_"),-1);
  335. sq_pushinteger(v,sizeof(SQInteger));
  336. sq_newslot(v,-3, SQFalse);
  337. sq_pushstring(v,_SC("_floatsize_"),-1);
  338. sq_pushinteger(v,sizeof(SQFloat));
  339. sq_newslot(v,-3, SQFalse);
  340. sq_pop(v,1);
  341. }
  342. static SQInteger default_delegate_len(HSQUIRRELVM v)
  343. {
  344. v->Push(SQInteger(sq_getsize(v,1)));
  345. return 1;
  346. }
  347. static SQInteger default_delegate_tofloat(HSQUIRRELVM v)
  348. {
  349. SQObjectPtr &o=stack_get(v,1);
  350. switch(type(o)){
  351. case OT_STRING:{
  352. SQObjectPtr res;
  353. if(str2num(_stringval(o),res)){
  354. v->Push(SQObjectPtr(tofloat(res)));
  355. break;
  356. }}
  357. return sq_throwerror(v, _SC("cannot convert the string"));
  358. break;
  359. case OT_INTEGER:case OT_FLOAT:
  360. v->Push(SQObjectPtr(tofloat(o)));
  361. break;
  362. case OT_BOOL:
  363. v->Push(SQObjectPtr((SQFloat)(_integer(o)?1:0)));
  364. break;
  365. default:
  366. v->PushNull();
  367. break;
  368. }
  369. return 1;
  370. }
  371. static SQInteger default_delegate_tointeger(HSQUIRRELVM v)
  372. {
  373. SQObjectPtr &o=stack_get(v,1);
  374. switch(type(o)){
  375. case OT_STRING:{
  376. SQObjectPtr res;
  377. SQInteger base;
  378. if(sq_gettop(v) > 1){
  379. if(sq_getinteger(v, 2, &base) < 0) return sq_throwerror(v, "parameter integer expected (2-36)");
  380. if(base < 2 || base > 36) return sq_throwerror(v, "invalid base \"%d\" to tointeger (2-36)", base);
  381. }
  382. else base = 10;
  383. if(str2num(_stringval(o),res, base)){
  384. v->Push(SQObjectPtr(tointeger(res)));
  385. break;
  386. }}
  387. return sq_throwerror(v, _SC("cannot convert the string"));
  388. break;
  389. case OT_INTEGER:case OT_FLOAT:
  390. v->Push(SQObjectPtr(tointeger(o)));
  391. break;
  392. case OT_BOOL:
  393. v->Push(SQObjectPtr(_integer(o)?(SQInteger)1:(SQInteger)0));
  394. break;
  395. default:
  396. v->PushNull();
  397. break;
  398. }
  399. return 1;
  400. }
  401. static SQInteger default_delegate_tostring(HSQUIRRELVM v)
  402. {
  403. sq_tostring(v,1);
  404. return 1;
  405. }
  406. static SQInteger obj_delegate_weakref(HSQUIRRELVM v)
  407. {
  408. sq_weakref(v,1);
  409. return 1;
  410. }
  411. static SQInteger obj_clear(HSQUIRRELVM v)
  412. {
  413. return sq_clear(v,-1);
  414. }
  415. static SQInteger number_delegate_tochar(HSQUIRRELVM v)
  416. {
  417. SQObject &o=stack_get(v,1);
  418. SQChar c = (SQChar)tointeger(o);
  419. v->Push(SQString::Create(_ss(v),(const SQChar *)&c,1));
  420. return 1;
  421. }
  422. /////////////////////////////////////////////////////////////////
  423. //TABLE DEFAULT DELEGATE
  424. static SQInteger table_rawdelete(HSQUIRRELVM v)
  425. {
  426. if(SQ_FAILED(sq_rawdeleteslot(v,1,SQTrue)))
  427. return SQ_ERROR;
  428. return 1;
  429. }
  430. static SQInteger container_rawexists(HSQUIRRELVM v)
  431. {
  432. if(SQ_SUCCEEDED(sq_rawget(v,-2))) {
  433. sq_pushbool(v,SQTrue);
  434. return 1;
  435. }
  436. sq_pushbool(v,SQFalse);
  437. return 1;
  438. }
  439. static SQInteger container_rawset(HSQUIRRELVM v)
  440. {
  441. return sq_rawset(v,-3);
  442. }
  443. static SQInteger container_rawget(HSQUIRRELVM v)
  444. {
  445. return SQ_SUCCEEDED(sq_rawget(v,-2))?1:SQ_ERROR;
  446. }
  447. static SQInteger table_setdelegate(HSQUIRRELVM v)
  448. {
  449. if(SQ_FAILED(sq_setdelegate(v,-2)))
  450. return SQ_ERROR;
  451. sq_push(v,-1); // -1 because sq_setdelegate pops 1
  452. return 1;
  453. }
  454. static SQInteger table_getdelegate(HSQUIRRELVM v)
  455. {
  456. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  457. }
  458. SQRegFunction SQSharedState::_table_default_delegate_funcz[]={
  459. {_SC("len"),default_delegate_len,1, _SC("t")},
  460. {_SC("rawget"),container_rawget,2, _SC("t")},
  461. {_SC("rawset"),container_rawset,3, _SC("t")},
  462. {_SC("rawdelete"),table_rawdelete,2, _SC("t")},
  463. {_SC("rawin"),container_rawexists,2, _SC("t")},
  464. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  465. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  466. {_SC("clear"),obj_clear,1, _SC(".")},
  467. {_SC("setdelegate"),table_setdelegate,2, _SC(".t|o")},
  468. {_SC("getdelegate"),table_getdelegate,1, _SC(".")},
  469. {0,0}
  470. };
  471. //ARRAY DEFAULT DELEGATE///////////////////////////////////////
  472. static SQInteger array_append(HSQUIRRELVM v)
  473. {
  474. return sq_arrayappend(v,-2);
  475. }
  476. static SQInteger array_extend(HSQUIRRELVM v)
  477. {
  478. _array(stack_get(v,1))->Extend(_array(stack_get(v,2)));
  479. return 0;
  480. }
  481. static SQInteger array_reverse(HSQUIRRELVM v)
  482. {
  483. return sq_arrayreverse(v,-1);
  484. }
  485. static SQInteger array_pop(HSQUIRRELVM v)
  486. {
  487. return SQ_SUCCEEDED(sq_arraypop(v,1,SQTrue))?1:SQ_ERROR;
  488. }
  489. static SQInteger array_top(HSQUIRRELVM v)
  490. {
  491. SQObject &o=stack_get(v,1);
  492. if(_array(o)->Size()>0){
  493. v->Push(_array(o)->Top());
  494. return 1;
  495. }
  496. else return sq_throwerror(v,_SC("top() on a empty array"));
  497. }
  498. static SQInteger array_insert(HSQUIRRELVM v)
  499. {
  500. SQObject &o=stack_get(v,1);
  501. SQObject &idx=stack_get(v,2);
  502. SQObject &val=stack_get(v,3);
  503. if(!_array(o)->Insert(tointeger(idx),val))
  504. return sq_throwerror(v,_SC("index out of range"));
  505. return 0;
  506. }
  507. static SQInteger array_remove(HSQUIRRELVM v)
  508. {
  509. SQObject &o = stack_get(v, 1);
  510. SQObject &idx = stack_get(v, 2);
  511. if(!sq_isnumeric(idx)) return sq_throwerror(v, _SC("wrong type"));
  512. SQObjectPtr val;
  513. if(_array(o)->Get(tointeger(idx), val)) {
  514. _array(o)->Remove(tointeger(idx));
  515. v->Push(val);
  516. return 1;
  517. }
  518. return sq_throwerror(v, _SC("idx out of range"));
  519. }
  520. static SQInteger array_resize(HSQUIRRELVM v)
  521. {
  522. SQObject &o = stack_get(v, 1);
  523. SQObject &nsize = stack_get(v, 2);
  524. SQObjectPtr fill;
  525. if(sq_isnumeric(nsize)) {
  526. if(sq_gettop(v) > 2)
  527. fill = stack_get(v, 3);
  528. _array(o)->Resize(tointeger(nsize),fill);
  529. return 0;
  530. }
  531. return sq_throwerror(v, _SC("size must be a number"));
  532. }
  533. static SQInteger __map_array(SQArray *dest,SQArray *src,HSQUIRRELVM v) {
  534. SQObjectPtr temp;
  535. SQInteger size = src->Size();
  536. for(SQInteger n = 0; n < size; n++) {
  537. src->Get(n,temp);
  538. v->Push(src);
  539. v->Push(temp);
  540. if(SQ_FAILED(sq_call(v,2,SQTrue,SQFalse))) {
  541. return SQ_ERROR;
  542. }
  543. dest->Set(n,v->GetUp(-1));
  544. v->Pop();
  545. }
  546. return 0;
  547. }
  548. static SQInteger array_map(HSQUIRRELVM v)
  549. {
  550. SQObject &o = stack_get(v,1);
  551. SQInteger size = _array(o)->Size();
  552. SQObjectPtr ret = SQArray::Create(_ss(v),size);
  553. if(SQ_FAILED(__map_array(_array(ret),_array(o),v)))
  554. return SQ_ERROR;
  555. v->Push(ret);
  556. return 1;
  557. }
  558. static SQInteger array_apply(HSQUIRRELVM v)
  559. {
  560. SQObject &o = stack_get(v,1);
  561. if(SQ_FAILED(__map_array(_array(o),_array(o),v)))
  562. return SQ_ERROR;
  563. return 0;
  564. }
  565. static SQInteger array_reduce(HSQUIRRELVM v)
  566. {
  567. SQObject &o = stack_get(v,1);
  568. SQArray *a = _array(o);
  569. SQInteger size = a->Size();
  570. if(size == 0) {
  571. return 0;
  572. }
  573. SQObjectPtr res;
  574. a->Get(0,res);
  575. if(size > 1) {
  576. SQObjectPtr other;
  577. for(SQInteger n = 1; n < size; n++) {
  578. a->Get(n,other);
  579. v->Push(o);
  580. v->Push(res);
  581. v->Push(other);
  582. if(SQ_FAILED(sq_call(v,3,SQTrue,SQFalse))) {
  583. return SQ_ERROR;
  584. }
  585. res = v->GetUp(-1);
  586. v->Pop();
  587. }
  588. }
  589. v->Push(res);
  590. return 1;
  591. }
  592. static SQInteger array_filter(HSQUIRRELVM v)
  593. {
  594. SQObject &o = stack_get(v,1);
  595. SQArray *a = _array(o);
  596. SQObjectPtr ret = SQArray::Create(_ss(v),0);
  597. SQInteger size = a->Size();
  598. SQObjectPtr val;
  599. for(SQInteger n = 0; n < size; n++) {
  600. a->Get(n,val);
  601. v->Push(o);
  602. v->Push(n);
  603. v->Push(val);
  604. if(SQ_FAILED(sq_call(v,3,SQTrue,SQFalse))) {
  605. return SQ_ERROR;
  606. }
  607. if(!SQVM::IsFalse(v->GetUp(-1))) {
  608. _array(ret)->Append(val);
  609. }
  610. v->Pop();
  611. }
  612. v->Push(ret);
  613. return 1;
  614. }
  615. static SQInteger array_find(HSQUIRRELVM v)
  616. {
  617. SQObject &o = stack_get(v,1);
  618. SQObjectPtr &val = stack_get(v,2);
  619. SQArray *a = _array(o);
  620. SQInteger size = a->Size();
  621. SQObjectPtr temp;
  622. for(SQInteger n = 0; n < size; n++) {
  623. bool res = false;
  624. a->Get(n,temp);
  625. if(SQVM::IsEqual(temp,val,res) && res) {
  626. v->Push(n);
  627. return 1;
  628. }
  629. }
  630. return 0;
  631. }
  632. bool _sort_compare(HSQUIRRELVM v,SQObjectPtr &a,SQObjectPtr &b,SQInteger func,SQInteger &ret)
  633. {
  634. if(func < 0) {
  635. if(!v->ObjCmp(a,b,ret)) return false;
  636. }
  637. else {
  638. SQInteger top = sq_gettop(v);
  639. sq_push(v, func);
  640. sq_pushroottable(v);
  641. v->Push(a);
  642. v->Push(b);
  643. if(SQ_FAILED(sq_call(v, 3, SQTrue, SQFalse))) {
  644. if(!sq_isstring( v->_lasterror))
  645. v->Raise_Error(_SC("compare func failed"));
  646. return false;
  647. }
  648. if(SQ_FAILED(sq_getinteger(v, -1, &ret))) {
  649. v->Raise_Error(_SC("numeric value expected as return value of the compare function"));
  650. return false;
  651. }
  652. sq_settop(v, top);
  653. return true;
  654. }
  655. return true;
  656. }
  657. bool _hsort_sift_down(HSQUIRRELVM v,SQArray *arr, SQInteger root, SQInteger bottom, SQInteger func)
  658. {
  659. SQInteger maxChild;
  660. SQInteger done = 0;
  661. SQInteger ret;
  662. SQInteger root2;
  663. while (((root2 = root * 2) <= bottom) && (!done))
  664. {
  665. if (root2 == bottom) {
  666. maxChild = root2;
  667. }
  668. else {
  669. if(!_sort_compare(v,arr->_values[root2],arr->_values[root2 + 1],func,ret))
  670. return false;
  671. if (ret > 0) {
  672. maxChild = root2;
  673. }
  674. else {
  675. maxChild = root2 + 1;
  676. }
  677. }
  678. if(!_sort_compare(v,arr->_values[root],arr->_values[maxChild],func,ret))
  679. return false;
  680. if (ret < 0) {
  681. if (root == maxChild) {
  682. v->Raise_Error(_SC("inconsistent compare function"));
  683. return false; // We'd be swapping ourselve. The compare function is incorrect
  684. }
  685. _Swap(arr->_values[root],arr->_values[maxChild]);
  686. root = maxChild;
  687. }
  688. else {
  689. done = 1;
  690. }
  691. }
  692. return true;
  693. }
  694. bool _hsort(HSQUIRRELVM v,SQObjectPtr &arr, SQInteger l, SQInteger r,SQInteger func)
  695. {
  696. SQArray *a = _array(arr);
  697. SQInteger i;
  698. SQInteger array_size = a->Size();
  699. for (i = (array_size / 2); i >= 0; i--) {
  700. if(!_hsort_sift_down(v,a, i, array_size - 1,func)) return false;
  701. }
  702. for (i = array_size-1; i >= 1; i--)
  703. {
  704. _Swap(a->_values[0],a->_values[i]);
  705. if(!_hsort_sift_down(v,a, 0, i-1,func)) return false;
  706. }
  707. return true;
  708. }
  709. static SQInteger array_sort(HSQUIRRELVM v)
  710. {
  711. SQInteger func = -1;
  712. SQObjectPtr &o = stack_get(v,1);
  713. if(_array(o)->Size() > 1) {
  714. if(sq_gettop(v) == 2) func = 2;
  715. if(!_hsort(v, o, 0, _array(o)->Size()-1, func))
  716. return SQ_ERROR;
  717. }
  718. return 0;
  719. }
  720. static SQInteger array_slice(HSQUIRRELVM v)
  721. {
  722. SQInteger sidx,eidx;
  723. SQObjectPtr o;
  724. if(get_slice_params(v,sidx,eidx,o)==-1)return -1;
  725. SQInteger alen = _array(o)->Size();
  726. if(sidx < 0)sidx = alen + sidx;
  727. if(eidx < 0)eidx = alen + eidx;
  728. if(eidx < sidx)return sq_throwerror(v,_SC("wrong indexes"));
  729. if(eidx > alen)return sq_throwerror(v,_SC("slice out of range"));
  730. SQArray *arr=SQArray::Create(_ss(v),eidx-sidx);
  731. SQObjectPtr t;
  732. SQInteger count=0;
  733. for(SQInteger i=sidx;i<eidx;i++){
  734. _array(o)->Get(i,t);
  735. arr->Set(count++,t);
  736. }
  737. v->Push(arr);
  738. return 1;
  739. }
  740. //DAD start
  741. #include <sqstdio.h>
  742. #include <sqstdblob.h>
  743. #include "sqstdstream.h"
  744. #include "sqstdblobimpl.h"
  745. SQ_OPT_STRING_STRLEN();
  746. static SQInteger array_concat0 (HSQUIRRELVM v, int allowAll) {
  747. SQ_FUNC_VARS(v);
  748. SQInteger last = sq_getsize(v, 1);
  749. if(last == 0){
  750. sq_pushstring(v, "", 0);
  751. return 1;
  752. }
  753. SQ_OPT_STRING(v, 2, sep, "");
  754. SQ_OPT_INTEGER(v, 3, i, 0);
  755. SQ_OPT_INTEGER(v, 4, opt_last, last);
  756. last = opt_last < last ? opt_last : last;
  757. opt_last = last -1;
  758. SQBlob blob(0, 8192);
  759. for (; i < last; i++) {
  760. sq_pushinteger(v, i);
  761. sq_rawget(v, 1);
  762. SQObject o = stack_get(v,-1);
  763. switch(type(o)){
  764. case OT_STRING:
  765. break;
  766. case OT_INTEGER:
  767. case OT_FLOAT:
  768. sq_tostring(v, -1);
  769. break;
  770. case OT_NULL:
  771. sq_tostring(v, -1);
  772. break;
  773. case OT_USERDATA:
  774. if(allowAll){
  775. sq_tostring(v, -1);
  776. break;
  777. }
  778. default:
  779. return sq_throwerror(v, "Invalid type \"%s\" at position %d for array concat !", GetTypeName(o), i);
  780. }
  781. const SQChar *value;
  782. sq_getstring(v, -1, &value);
  783. SQInteger value_size = sq_getsize(v, -1);
  784. blob.Write((void*)value, value_size);
  785. if(i != opt_last) blob.Write((void*)sep, sep_size);
  786. sq_settop(v, _top_);
  787. }
  788. sq_pushstring(v, (SQChar*)blob.GetBuf(), blob.Len());
  789. return 1;
  790. }
  791. static SQInteger array_concat (HSQUIRRELVM v) {
  792. return array_concat0(v, 0);
  793. }
  794. static SQInteger array_concat2 (HSQUIRRELVM v) {
  795. return array_concat0(v, 1);
  796. }
  797. static SQInteger array_getdelegate(HSQUIRRELVM v)
  798. {
  799. sq_pushobject(v,_ss(v)->_array_default_delegate);
  800. return 1;
  801. }
  802. //DAD end
  803. SQRegFunction SQSharedState::_array_default_delegate_funcz[]={
  804. {_SC("len"),default_delegate_len,1, _SC("a")},
  805. {_SC("append"),array_append,2, _SC("a")},
  806. {_SC("extend"),array_extend,2, _SC("aa")},
  807. {_SC("push"),array_append,2, _SC("a")},
  808. {_SC("pop"),array_pop,1, _SC("a")},
  809. {_SC("top"),array_top,1, _SC("a")},
  810. {_SC("insert"),array_insert,3, _SC("an")},
  811. {_SC("remove"),array_remove,2, _SC("an")},
  812. {_SC("resize"),array_resize,-2, _SC("an")},
  813. {_SC("reverse"),array_reverse,1, _SC("a")},
  814. {_SC("sort"),array_sort,-1, _SC("ac")},
  815. {_SC("slice"),array_slice,-1, _SC("ann")},
  816. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  817. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  818. {_SC("clear"),obj_clear,1, _SC(".")},
  819. {_SC("map"),array_map,2, _SC("ac")},
  820. {_SC("apply"),array_apply,2, _SC("ac")},
  821. {_SC("reduce"),array_reduce,2, _SC("ac")},
  822. {_SC("filter"),array_filter,2, _SC("ac")},
  823. {_SC("find"),array_find,2, _SC("a.")},
  824. {_SC("concat"),array_concat,-1, _SC("as")},
  825. {_SC("concat2"),array_concat2,-1, _SC("as")},
  826. {_SC("getdelegate"),array_getdelegate,1, _SC(".")},
  827. {0,0}
  828. };
  829. //STRING DEFAULT DELEGATE//////////////////////////
  830. static SQInteger string_slice(HSQUIRRELVM v)
  831. {
  832. SQInteger sidx,eidx;
  833. SQObjectPtr o;
  834. if(SQ_FAILED(get_slice_params(v,sidx,eidx,o)))return -1;
  835. SQInteger slen = _string(o)->_len;
  836. if(sidx < 0)sidx = slen + sidx;
  837. if(eidx < 0)eidx = slen + eidx;
  838. if(eidx < sidx) return sq_throwerror(v,_SC("wrong indexes"));
  839. if(eidx > slen) return sq_throwerror(v,_SC("slice out of range"));
  840. v->Push(SQString::Create(_ss(v),&_stringval(o)[sidx],eidx-sidx));
  841. return 1;
  842. }
  843. static SQInteger string_find(HSQUIRRELVM v)
  844. {
  845. SQInteger top,start_idx=0;
  846. const SQChar *str,*substr,*ret;
  847. if(((top=sq_gettop(v))>1) && SQ_SUCCEEDED(sq_getstring(v,1,&str)) && SQ_SUCCEEDED(sq_getstring(v,2,&substr))){
  848. if(top>2)sq_getinteger(v,3,&start_idx);
  849. if((sq_getsize(v,1)>start_idx) && (start_idx>=0)){
  850. ret=scstrstr(&str[start_idx],substr);
  851. if(ret){
  852. sq_pushinteger(v,(SQInteger)(ret-str));
  853. return 1;
  854. }
  855. }
  856. return 0;
  857. }
  858. return sq_throwerror(v,_SC("invalid param"));
  859. }
  860. #define STRING_TOFUNCZ(func) static SQInteger string_##func(HSQUIRRELVM v) \
  861. { \
  862. SQObject str=stack_get(v,1); \
  863. SQInteger len=_string(str)->_len; \
  864. const SQChar *sThis=_stringval(str); \
  865. SQChar *sNew=(_ss(v)->GetScratchPad(rsl(len))); \
  866. for(SQInteger i=0;i<len;i++) sNew[i]=func(sThis[i]); \
  867. v->Push(SQString::Create(_ss(v),sNew,len)); \
  868. return 1; \
  869. }
  870. STRING_TOFUNCZ(tolower)
  871. STRING_TOFUNCZ(toupper)
  872. //DAD start
  873. #include "lua-regex.h"
  874. static int process_string_gsub(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  875. const char *str;
  876. SQInteger str_size;
  877. HSQUIRRELVM v = (HSQUIRRELVM)udata;
  878. SQObjectType rtype = sq_gettype(v, 3);
  879. SQInteger top = sq_gettop(v);
  880. int result = 1;
  881. switch(rtype){
  882. case OT_CLOSURE:{
  883. sq_push(v, 3); //push the function
  884. sq_pushroottable(v); //this
  885. int i=0;
  886. for(; i < ms->level; ++i){
  887. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  888. }
  889. int rc = sq_call(v, i+1, SQTrue, SQTrue);
  890. if(rc < 0) return rc;
  891. if(SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &str, &str_size))){
  892. if(!char_buffer_add_str(ms, b, str, str_size)) {
  893. result = 0;
  894. break;
  895. }
  896. }
  897. }
  898. break;
  899. case OT_ARRAY:{
  900. for(int i=0; i < ms->level; ++i){
  901. sq_pushinteger(v, i);
  902. sq_get(v, 3);
  903. if(SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &str, &str_size))){
  904. if(!char_buffer_add_str(ms, b, str, str_size)) {
  905. result = 0;
  906. break;
  907. }
  908. }
  909. sq_pop(v, 1); //remove value
  910. }
  911. }
  912. break;
  913. case OT_TABLE:{
  914. for(int i=0; i < ms->level; ++i){
  915. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  916. sq_get(v, 3);
  917. if(SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &str, &str_size))){
  918. if(!char_buffer_add_str(ms, b, str, str_size)) {
  919. result = 0;
  920. break;
  921. }
  922. }
  923. sq_pop(v, 1); //remove value
  924. }
  925. }
  926. }
  927. sq_settop(v, top); //restore the stack to it's original state
  928. return result; //returning non zero means continue
  929. }
  930. static SQInteger string_gsub(HSQUIRRELVM v)
  931. {
  932. const char *error_ptr;
  933. SQ_FUNC_VARS(v);
  934. SQ_GET_STRING(v, 1, src);
  935. SQ_GET_STRING(v, 2, pattern);
  936. SQ_OPT_INTEGER(v, 4, max_sub, 0);
  937. SQObjectType rtype = sq_gettype(v, 3);
  938. if(rtype == OT_STRING){
  939. SQ_GET_STRING(v, 3, replacement);
  940. char_buffer_st *buf = str_gsub (src, src_size, pattern, pattern_size,
  941. replacement, replacement_size, max_sub, &error_ptr, 0, 0);
  942. if(buf){
  943. sq_pushstring(v, buf->buf, buf->used);
  944. free(buf);
  945. return 1;
  946. }
  947. return sq_throwerror(v,error_ptr);
  948. }
  949. else
  950. {
  951. switch(rtype){
  952. case OT_CLOSURE:
  953. case OT_ARRAY:
  954. case OT_TABLE:{
  955. char_buffer_st *buf = str_gsub (src, src_size, pattern, pattern_size,
  956. 0, 0, max_sub, &error_ptr, process_string_gsub, v);
  957. if(buf){
  958. sq_pushstring(v, buf->buf, buf->used);
  959. free(buf);
  960. return 1;
  961. }
  962. return sq_throwerror(v,error_ptr);
  963. }
  964. }
  965. }
  966. return sq_throwerror(v,"invalid type for parameter 3 function/table/array/string expected");
  967. }
  968. static int process_string_gmatch(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  969. HSQUIRRELVM v = (HSQUIRRELVM)udata;
  970. SQInteger top = sq_gettop(v);
  971. int result = 1;
  972. sq_pushroottable(v); //this en, function already on top of stack
  973. int i=0;
  974. for(; i < ms->level; ++i){
  975. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  976. }
  977. int rc = sq_call(v, i+1, SQTrue, SQTrue);
  978. if(rc < 0) return rc;
  979. SQObjectType rtype = sq_gettype(v, -1);
  980. if(rtype == OT_BOOL) {
  981. SQBool b;
  982. sq_getbool(v, -1, &b);
  983. result = b == SQTrue;
  984. }
  985. else result = rtype != OT_NULL;
  986. sq_settop(v, top); //restore the stack to it's original state
  987. return result; //returning non zero means continue
  988. }
  989. static SQInteger string_gmatch(HSQUIRRELVM v)
  990. {
  991. SQ_FUNC_VARS_NO_TOP(v);
  992. SQ_GET_STRING(v, 1, src);
  993. SQ_GET_STRING(v, 2, pattern);
  994. SQInteger rtype = sq_gettype(v, 3);
  995. if(rtype == OT_CLOSURE){
  996. LuaMatchState ms;
  997. memset(&ms, 0, sizeof(ms));
  998. str_match(&ms, src, src_size, pattern, pattern_size,
  999. 0, 0, process_string_gmatch, v);
  1000. if(ms.error) return sq_throwerror(v, ms.error);
  1001. return 0;
  1002. }
  1003. return sq_throwerror(v,"invalid type for parameter 3 function expected");
  1004. }
  1005. static SQInteger string_getdelegate(HSQUIRRELVM v)
  1006. {
  1007. sq_pushobject(v,_ss(v)->_string_default_delegate);
  1008. return 1;
  1009. }
  1010. //DAD end
  1011. SQRegFunction SQSharedState::_string_default_delegate_funcz[]={
  1012. {_SC("len"),default_delegate_len,1, _SC("s")},
  1013. {_SC("tointeger"),default_delegate_tointeger,-1, _SC("si")},
  1014. {_SC("tofloat"),default_delegate_tofloat,1, _SC("s")},
  1015. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1016. {_SC("slice"),string_slice,-1, _SC(" s n n")},
  1017. {_SC("find"),string_find,-2, _SC("s s n ")},
  1018. {_SC("gsub"),string_gsub,-3, _SC("s s s|a|t|c n")},
  1019. {_SC("gmatch"),string_gmatch, 3, _SC("s s c")},
  1020. {_SC("tolower"),string_tolower,1, _SC("s")},
  1021. {_SC("toupper"),string_toupper,1, _SC("s")},
  1022. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1023. {_SC("getdelegate"),string_getdelegate,1, _SC(".")},
  1024. {0,0}
  1025. };
  1026. //INTEGER DEFAULT DELEGATE//////////////////////////
  1027. static SQInteger number_getdelegate(HSQUIRRELVM v)
  1028. {
  1029. sq_pushobject(v,_ss(v)->_number_default_delegate);
  1030. return 1;
  1031. }
  1032. SQRegFunction SQSharedState::_number_default_delegate_funcz[]={
  1033. {_SC("tointeger"),default_delegate_tointeger,1, _SC("n|b")},
  1034. {_SC("tofloat"),default_delegate_tofloat,1, _SC("n|b")},
  1035. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1036. {_SC("tochar"),number_delegate_tochar,1, _SC("n|b")},
  1037. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1038. {_SC("getdelegate"),number_getdelegate,1, _SC(".")},
  1039. {0,0}
  1040. };
  1041. //CLOSURE DEFAULT DELEGATE//////////////////////////
  1042. static SQInteger closure_pcall(HSQUIRRELVM v)
  1043. {
  1044. return SQ_SUCCEEDED(sq_call(v,sq_gettop(v)-1,SQTrue,SQFalse))?1:SQ_ERROR;
  1045. }
  1046. static SQInteger closure_call(HSQUIRRELVM v)
  1047. {
  1048. return SQ_SUCCEEDED(sq_call(v,sq_gettop(v)-1,SQTrue,SQTrue))?1:SQ_ERROR;
  1049. }
  1050. static SQInteger _closure_acall(HSQUIRRELVM v,SQBool raiseerror)
  1051. {
  1052. SQArray *aparams=_array(stack_get(v,2));
  1053. SQInteger nparams=aparams->Size();
  1054. v->Push(stack_get(v,1));
  1055. for(SQInteger i=0;i<nparams;i++)v->Push(aparams->_values[i]);
  1056. return SQ_SUCCEEDED(sq_call(v,nparams,SQTrue,raiseerror))?1:SQ_ERROR;
  1057. }
  1058. static SQInteger closure_acall(HSQUIRRELVM v)
  1059. {
  1060. return _closure_acall(v,SQTrue);
  1061. }
  1062. static SQInteger closure_pacall(HSQUIRRELVM v)
  1063. {
  1064. return _closure_acall(v,SQFalse);
  1065. }
  1066. static SQInteger closure_bindenv(HSQUIRRELVM v)
  1067. {
  1068. if(SQ_FAILED(sq_bindenv(v,1)))
  1069. return SQ_ERROR;
  1070. return 1;
  1071. }
  1072. static SQInteger closure_getinfos(HSQUIRRELVM v) {
  1073. SQObject o = stack_get(v,1);
  1074. SQTable *res = SQTable::Create(_ss(v),4);
  1075. if(type(o) == OT_CLOSURE) {
  1076. SQFunctionProto *f = _closure(o)->_function;
  1077. SQInteger nparams = f->_nparameters + (f->_varparams?1:0);
  1078. SQObjectPtr params = SQArray::Create(_ss(v),nparams);
  1079. SQObjectPtr defparams = SQArray::Create(_ss(v),f->_ndefaultparams);
  1080. for(SQInteger n = 0; n<f->_nparameters; n++) {
  1081. _array(params)->Set((SQInteger)n,f->_parameters[n]);
  1082. }
  1083. for(SQInteger j = 0; j<f->_ndefaultparams; j++) {
  1084. _array(defparams)->Set((SQInteger)j,_closure(o)->_defaultparams[j]);
  1085. }
  1086. if(f->_varparams) {
  1087. _array(params)->Set(nparams-1,SQString::Create(_ss(v),_SC("..."),-1));
  1088. }
  1089. res->NewSlot(SQString::Create(_ss(v),_SC("native"),-1),false);
  1090. res->NewSlot(SQString::Create(_ss(v),_SC("name"),-1),f->_name);
  1091. res->NewSlot(SQString::Create(_ss(v),_SC("src"),-1),f->_sourcename);
  1092. res->NewSlot(SQString::Create(_ss(v),_SC("parameters"),-1),params);
  1093. res->NewSlot(SQString::Create(_ss(v),_SC("varargs"),-1),f->_varparams);
  1094. res->NewSlot(SQString::Create(_ss(v),_SC("defparams"),-1),defparams);
  1095. }
  1096. else { //OT_NATIVECLOSURE
  1097. SQNativeClosure *nc = _nativeclosure(o);
  1098. res->NewSlot(SQString::Create(_ss(v),_SC("native"),-1),true);
  1099. res->NewSlot(SQString::Create(_ss(v),_SC("name"),-1),nc->_name);
  1100. res->NewSlot(SQString::Create(_ss(v),_SC("paramscheck"),-1),nc->_nparamscheck);
  1101. SQObjectPtr typecheck;
  1102. if(nc->_typecheck.size() > 0) {
  1103. typecheck =
  1104. SQArray::Create(_ss(v), nc->_typecheck.size());
  1105. for(SQUnsignedInteger n = 0; n<nc->_typecheck.size(); n++) {
  1106. _array(typecheck)->Set((SQInteger)n,nc->_typecheck[n]);
  1107. }
  1108. }
  1109. res->NewSlot(SQString::Create(_ss(v),_SC("typecheck"),-1),typecheck);
  1110. }
  1111. v->Push(res);
  1112. return 1;
  1113. }
  1114. SQRegFunction SQSharedState::_closure_default_delegate_funcz[]={
  1115. {_SC("call"),closure_call,-1, _SC("c")},
  1116. {_SC("pcall"),closure_pcall,-1, _SC("c")},
  1117. {_SC("acall"),closure_acall,2, _SC("ca")},
  1118. {_SC("pacall"),closure_pacall,2, _SC("ca")},
  1119. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1120. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1121. {_SC("bindenv"),closure_bindenv,2, _SC("c x|y|t")},
  1122. {_SC("getinfos"),closure_getinfos,1, _SC("c")},
  1123. {0,0}
  1124. };
  1125. //GENERATOR DEFAULT DELEGATE
  1126. static SQInteger generator_getstatus(HSQUIRRELVM v)
  1127. {
  1128. SQObject &o=stack_get(v,1);
  1129. switch(_generator(o)->_state){
  1130. case SQGenerator::eSuspended:v->Push(SQString::Create(_ss(v),_SC("suspended")));break;
  1131. case SQGenerator::eRunning:v->Push(SQString::Create(_ss(v),_SC("running")));break;
  1132. case SQGenerator::eDead:v->Push(SQString::Create(_ss(v),_SC("dead")));break;
  1133. }
  1134. return 1;
  1135. }
  1136. SQRegFunction SQSharedState::_generator_default_delegate_funcz[]={
  1137. {_SC("getstatus"),generator_getstatus,1, _SC("g")},
  1138. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1139. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1140. {0,0}
  1141. };
  1142. //THREAD DEFAULT DELEGATE
  1143. static SQInteger thread_call(HSQUIRRELVM v)
  1144. {
  1145. SQObjectPtr o = stack_get(v,1);
  1146. if(type(o) == OT_THREAD) {
  1147. SQInteger nparams = sq_gettop(v);
  1148. _thread(o)->Push(_thread(o)->_roottable);
  1149. for(SQInteger i = 2; i<(nparams+1); i++)
  1150. sq_move(_thread(o),v,i);
  1151. if(SQ_SUCCEEDED(sq_call(_thread(o),nparams,SQTrue,SQTrue))) {
  1152. sq_move(v,_thread(o),-1);
  1153. sq_pop(_thread(o),1);
  1154. return 1;
  1155. }
  1156. v->_lasterror = _thread(o)->_lasterror;
  1157. return SQ_ERROR;
  1158. }
  1159. return sq_throwerror(v,_SC("wrong parameter"));
  1160. }
  1161. static SQInteger thread_wakeup(HSQUIRRELVM v)
  1162. {
  1163. SQObjectPtr o = stack_get(v,1);
  1164. if(type(o) == OT_THREAD) {
  1165. SQVM *thread = _thread(o);
  1166. SQInteger state = sq_getvmstate(thread);
  1167. if(state != SQ_VMSTATE_SUSPENDED) {
  1168. switch(state) {
  1169. case SQ_VMSTATE_IDLE:
  1170. return sq_throwerror(v,_SC("cannot wakeup a idle thread"));
  1171. break;
  1172. case SQ_VMSTATE_RUNNING:
  1173. return sq_throwerror(v,_SC("cannot wakeup a running thread"));
  1174. break;
  1175. }
  1176. }
  1177. SQInteger wakeupret = sq_gettop(v)>1?1:0;
  1178. if(wakeupret) {
  1179. sq_move(thread,v,2);
  1180. }
  1181. if(SQ_SUCCEEDED(sq_wakeupvm(thread,wakeupret,SQTrue,SQTrue,SQFalse))) {
  1182. sq_move(v,thread,-1);
  1183. sq_pop(thread,1); //pop retval
  1184. if(sq_getvmstate(thread) == SQ_VMSTATE_IDLE) {
  1185. sq_settop(thread,1); //pop roottable
  1186. }
  1187. return 1;
  1188. }
  1189. sq_settop(thread,1);
  1190. v->_lasterror = thread->_lasterror;
  1191. return SQ_ERROR;
  1192. }
  1193. return sq_throwerror(v,_SC("wrong parameter"));
  1194. }
  1195. static SQInteger thread_getstatus(HSQUIRRELVM v)
  1196. {
  1197. SQObjectPtr &o = stack_get(v,1);
  1198. switch(sq_getvmstate(_thread(o))) {
  1199. case SQ_VMSTATE_IDLE:
  1200. sq_pushstring(v,_SC("idle"),-1);
  1201. break;
  1202. case SQ_VMSTATE_RUNNING:
  1203. sq_pushstring(v,_SC("running"),-1);
  1204. break;
  1205. case SQ_VMSTATE_SUSPENDED:
  1206. sq_pushstring(v,_SC("suspended"),-1);
  1207. break;
  1208. default:
  1209. return sq_throwerror(v,_SC("internal VM error"));
  1210. }
  1211. return 1;
  1212. }
  1213. static SQInteger thread_getstackinfos(HSQUIRRELVM v)
  1214. {
  1215. SQObjectPtr o = stack_get(v,1);
  1216. if(type(o) == OT_THREAD) {
  1217. SQVM *thread = _thread(o);
  1218. SQInteger threadtop = sq_gettop(thread);
  1219. SQInteger level;
  1220. sq_getinteger(v,-1,&level);
  1221. SQRESULT res = __getcallstackinfos(thread,level);
  1222. if(SQ_FAILED(res))
  1223. {
  1224. sq_settop(thread,threadtop);
  1225. if(type(thread->_lasterror) == OT_STRING) {
  1226. sq_throwerror(v,_stringval(thread->_lasterror));
  1227. }
  1228. else {
  1229. sq_throwerror(v,_SC("unknown error"));
  1230. }
  1231. }
  1232. if(res > 0) {
  1233. //some result
  1234. sq_move(v,thread,-1);
  1235. sq_settop(thread,threadtop);
  1236. return 1;
  1237. }
  1238. //no result
  1239. sq_settop(thread,threadtop);
  1240. return 0;
  1241. }
  1242. return sq_throwerror(v,_SC("wrong parameter"));
  1243. }
  1244. SQRegFunction SQSharedState::_thread_default_delegate_funcz[] = {
  1245. {_SC("call"), thread_call, -1, _SC("v")},
  1246. {_SC("wakeup"), thread_wakeup, -1, _SC("v")},
  1247. {_SC("getstatus"), thread_getstatus, 1, _SC("v")},
  1248. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1249. {_SC("getstackinfos"),thread_getstackinfos,2, _SC("vn")},
  1250. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1251. {0,0},
  1252. };
  1253. static SQInteger class_getattributes(HSQUIRRELVM v)
  1254. {
  1255. return SQ_SUCCEEDED(sq_getattributes(v,-2))?1:SQ_ERROR;
  1256. }
  1257. static SQInteger class_setattributes(HSQUIRRELVM v)
  1258. {
  1259. return SQ_SUCCEEDED(sq_setattributes(v,-3))?1:SQ_ERROR;
  1260. }
  1261. static SQInteger class_instance(HSQUIRRELVM v)
  1262. {
  1263. return SQ_SUCCEEDED(sq_createinstance(v,-1))?1:SQ_ERROR;
  1264. }
  1265. static SQInteger class_getbase(HSQUIRRELVM v)
  1266. {
  1267. return SQ_SUCCEEDED(sq_getbase(v,-1))?1:SQ_ERROR;
  1268. }
  1269. static SQInteger class_newmember(HSQUIRRELVM v)
  1270. {
  1271. SQInteger top = sq_gettop(v);
  1272. SQBool bstatic = SQFalse;
  1273. if(top == 5)
  1274. {
  1275. sq_tobool(v,-1,&bstatic);
  1276. sq_pop(v,1);
  1277. }
  1278. if(top < 4) {
  1279. sq_pushnull(v);
  1280. }
  1281. return SQ_SUCCEEDED(sq_newmember(v,-4,bstatic))?1:SQ_ERROR;
  1282. }
  1283. static SQInteger class_rawnewmember(HSQUIRRELVM v)
  1284. {
  1285. SQInteger top = sq_gettop(v);
  1286. SQBool bstatic = SQFalse;
  1287. if(top == 5)
  1288. {
  1289. sq_tobool(v,-1,&bstatic);
  1290. sq_pop(v,1);
  1291. }
  1292. if(top < 4) {
  1293. sq_pushnull(v);
  1294. }
  1295. return SQ_SUCCEEDED(sq_rawnewmember(v,-4,bstatic))?1:SQ_ERROR;
  1296. }
  1297. static SQInteger class_getdelegate(HSQUIRRELVM v)
  1298. {
  1299. sq_pushobject(v,_ss(v)->_class_default_delegate);
  1300. return 1;
  1301. }
  1302. SQRegFunction SQSharedState::_class_default_delegate_funcz[] = {
  1303. {_SC("getattributes"), class_getattributes, 2, _SC("y.")},
  1304. {_SC("setattributes"), class_setattributes, 3, _SC("y..")},
  1305. {_SC("rawget"),container_rawget,2, _SC("y")},
  1306. {_SC("rawset"),container_rawset,3, _SC("y")},
  1307. {_SC("rawin"),container_rawexists,2, _SC("y")},
  1308. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1309. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1310. {_SC("instance"),class_instance,1, _SC("y")},
  1311. {_SC("getbase"),class_getbase,1, _SC("y")},
  1312. {_SC("newmember"),class_newmember,-3, _SC("y")},
  1313. {_SC("rawnewmember"),class_rawnewmember,-3, _SC("y")},
  1314. {_SC("getdelegate"),class_getdelegate,1, _SC(".")},
  1315. {0,0}
  1316. };
  1317. static SQInteger instance_getclass(HSQUIRRELVM v)
  1318. {
  1319. if(SQ_SUCCEEDED(sq_getclass(v,1)))
  1320. return 1;
  1321. return SQ_ERROR;
  1322. }
  1323. SQRegFunction SQSharedState::_instance_default_delegate_funcz[] = {
  1324. {_SC("getclass"), instance_getclass, 1, _SC("x")},
  1325. {_SC("rawget"),container_rawget,2, _SC("x")},
  1326. {_SC("rawset"),container_rawset,3, _SC("x")},
  1327. {_SC("rawin"),container_rawexists,2, _SC("x")},
  1328. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1329. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1330. {0,0}
  1331. };
  1332. static SQInteger weakref_ref(HSQUIRRELVM v)
  1333. {
  1334. if(SQ_FAILED(sq_getweakrefval(v,1)))
  1335. return SQ_ERROR;
  1336. return 1;
  1337. }
  1338. SQRegFunction SQSharedState::_weakref_default_delegate_funcz[] = {
  1339. {_SC("ref"),weakref_ref,1, _SC("r")},
  1340. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1341. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1342. {0,0}
  1343. };