sqbaselib.cpp 44 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648
  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. SQInteger top = sq_gettop(v);
  446. switch(sq_gettop(v)){
  447. case 2: return SQ_SUCCEEDED(sq_rawget(v,-2))?1:SQ_ERROR;break;
  448. case 3: {
  449. sq_push(v, 2); //copy key to top
  450. sq_rawget(v,-3); //if it fail pop the key and default value is on top
  451. return 1;
  452. }
  453. break;
  454. }
  455. return sq_throwerror(v, _SC("invalid number of parameters"));
  456. }
  457. static SQInteger container_get(HSQUIRRELVM v)
  458. {
  459. SQInteger top = sq_gettop(v);
  460. switch(sq_gettop(v)){
  461. case 2: return SQ_SUCCEEDED(sq_get(v,-2))?1:SQ_ERROR;break;
  462. case 3: {
  463. sq_push(v, 2); //copy key to top
  464. sq_get(v,-3); //if it fail pop the key and default value is on top
  465. return 1;
  466. }
  467. break;
  468. }
  469. return sq_throwerror(v, _SC("invalid number of parameters"));
  470. }
  471. static SQInteger table_setdelegate(HSQUIRRELVM v)
  472. {
  473. if(SQ_FAILED(sq_setdelegate(v,-2)))
  474. return SQ_ERROR;
  475. sq_push(v,-1); // -1 because sq_setdelegate pops 1
  476. return 1;
  477. }
  478. static SQInteger table_getdelegate(HSQUIRRELVM v)
  479. {
  480. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  481. }
  482. SQRegFunction SQSharedState::_table_default_delegate_funcz[]={
  483. {_SC("len"),default_delegate_len,1, _SC("t")},
  484. {_SC("get"),container_get,-2, _SC("t")},
  485. {_SC("rawget"),container_rawget,-2, _SC("t")},
  486. {_SC("rawset"),container_rawset,3, _SC("t")},
  487. {_SC("rawdelete"),table_rawdelete,2, _SC("t")},
  488. {_SC("rawin"),container_rawexists,2, _SC("t")},
  489. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  490. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  491. {_SC("clear"),obj_clear,1, _SC(".")},
  492. {_SC("setdelegate"),table_setdelegate,2, _SC(".t|o")},
  493. {_SC("getdelegate"),table_getdelegate,1, _SC(".")},
  494. {0,0}
  495. };
  496. //ARRAY DEFAULT DELEGATE///////////////////////////////////////
  497. static SQInteger array_append(HSQUIRRELVM v)
  498. {
  499. return sq_arrayappend(v,-2);
  500. }
  501. static SQInteger array_extend(HSQUIRRELVM v)
  502. {
  503. _array(stack_get(v,1))->Extend(_array(stack_get(v,2)));
  504. return 0;
  505. }
  506. static SQInteger array_reverse(HSQUIRRELVM v)
  507. {
  508. return sq_arrayreverse(v,-1);
  509. }
  510. static SQInteger array_pop(HSQUIRRELVM v)
  511. {
  512. return SQ_SUCCEEDED(sq_arraypop(v,1,SQTrue))?1:SQ_ERROR;
  513. }
  514. static SQInteger array_top(HSQUIRRELVM v)
  515. {
  516. SQObject &o=stack_get(v,1);
  517. if(_array(o)->Size()>0){
  518. v->Push(_array(o)->Top());
  519. return 1;
  520. }
  521. else return sq_throwerror(v,_SC("top() on a empty array"));
  522. }
  523. static SQInteger array_insert(HSQUIRRELVM v)
  524. {
  525. SQObject &o=stack_get(v,1);
  526. SQObject &idx=stack_get(v,2);
  527. SQObject &val=stack_get(v,3);
  528. if(!_array(o)->Insert(tointeger(idx),val))
  529. return sq_throwerror(v,_SC("index out of range"));
  530. return 0;
  531. }
  532. static SQInteger array_remove(HSQUIRRELVM v)
  533. {
  534. SQObject &o = stack_get(v, 1);
  535. SQObject &idx = stack_get(v, 2);
  536. if(!sq_isnumeric(idx)) return sq_throwerror(v, _SC("wrong type"));
  537. SQObjectPtr val;
  538. if(_array(o)->Get(tointeger(idx), val)) {
  539. _array(o)->Remove(tointeger(idx));
  540. v->Push(val);
  541. return 1;
  542. }
  543. return sq_throwerror(v, _SC("idx out of range"));
  544. }
  545. static SQInteger array_resize(HSQUIRRELVM v)
  546. {
  547. SQObject &o = stack_get(v, 1);
  548. SQObject &nsize = stack_get(v, 2);
  549. SQObjectPtr fill;
  550. if(sq_isnumeric(nsize)) {
  551. if(sq_gettop(v) > 2)
  552. fill = stack_get(v, 3);
  553. _array(o)->Resize(tointeger(nsize),fill);
  554. return 0;
  555. }
  556. return sq_throwerror(v, _SC("size must be a number"));
  557. }
  558. static SQInteger __map_array(SQArray *dest,SQArray *src,HSQUIRRELVM v) {
  559. SQObjectPtr temp;
  560. SQInteger size = src->Size();
  561. for(SQInteger n = 0; n < size; n++) {
  562. src->Get(n,temp);
  563. v->Push(src);
  564. v->Push(temp);
  565. if(SQ_FAILED(sq_call(v,2,SQTrue,SQFalse))) {
  566. return SQ_ERROR;
  567. }
  568. dest->Set(n,v->GetUp(-1));
  569. v->Pop();
  570. }
  571. return 0;
  572. }
  573. static SQInteger array_map(HSQUIRRELVM v)
  574. {
  575. SQObject &o = stack_get(v,1);
  576. SQInteger size = _array(o)->Size();
  577. SQObjectPtr ret = SQArray::Create(_ss(v),size);
  578. if(SQ_FAILED(__map_array(_array(ret),_array(o),v)))
  579. return SQ_ERROR;
  580. v->Push(ret);
  581. return 1;
  582. }
  583. static SQInteger array_apply(HSQUIRRELVM v)
  584. {
  585. SQObject &o = stack_get(v,1);
  586. if(SQ_FAILED(__map_array(_array(o),_array(o),v)))
  587. return SQ_ERROR;
  588. return 0;
  589. }
  590. static SQInteger array_reduce(HSQUIRRELVM v)
  591. {
  592. SQObject &o = stack_get(v,1);
  593. SQArray *a = _array(o);
  594. SQInteger size = a->Size();
  595. if(size == 0) {
  596. return 0;
  597. }
  598. SQObjectPtr res;
  599. a->Get(0,res);
  600. if(size > 1) {
  601. SQObjectPtr other;
  602. for(SQInteger n = 1; n < size; n++) {
  603. a->Get(n,other);
  604. v->Push(o);
  605. v->Push(res);
  606. v->Push(other);
  607. if(SQ_FAILED(sq_call(v,3,SQTrue,SQFalse))) {
  608. return SQ_ERROR;
  609. }
  610. res = v->GetUp(-1);
  611. v->Pop();
  612. }
  613. }
  614. v->Push(res);
  615. return 1;
  616. }
  617. static SQInteger array_filter(HSQUIRRELVM v)
  618. {
  619. SQObject &o = stack_get(v,1);
  620. SQArray *a = _array(o);
  621. SQObjectPtr ret = SQArray::Create(_ss(v),0);
  622. SQInteger size = a->Size();
  623. SQObjectPtr val;
  624. for(SQInteger n = 0; n < size; n++) {
  625. a->Get(n,val);
  626. v->Push(o);
  627. v->Push(n);
  628. v->Push(val);
  629. if(SQ_FAILED(sq_call(v,3,SQTrue,SQFalse))) {
  630. return SQ_ERROR;
  631. }
  632. if(!SQVM::IsFalse(v->GetUp(-1))) {
  633. _array(ret)->Append(val);
  634. }
  635. v->Pop();
  636. }
  637. v->Push(ret);
  638. return 1;
  639. }
  640. static SQInteger array_find(HSQUIRRELVM v)
  641. {
  642. SQObject &o = stack_get(v,1);
  643. SQObjectPtr &val = stack_get(v,2);
  644. SQArray *a = _array(o);
  645. SQInteger size = a->Size();
  646. SQObjectPtr temp;
  647. for(SQInteger n = 0; n < size; n++) {
  648. bool res = false;
  649. a->Get(n,temp);
  650. if(SQVM::IsEqual(temp,val,res) && res) {
  651. v->Push(n);
  652. return 1;
  653. }
  654. }
  655. return 0;
  656. }
  657. bool _sort_compare(HSQUIRRELVM v,SQObjectPtr &a,SQObjectPtr &b,SQInteger func,SQInteger &ret)
  658. {
  659. if(func < 0) {
  660. if(!v->ObjCmp(a,b,ret)) return false;
  661. }
  662. else {
  663. SQInteger top = sq_gettop(v);
  664. sq_push(v, func);
  665. sq_pushroottable(v);
  666. v->Push(a);
  667. v->Push(b);
  668. if(SQ_FAILED(sq_call(v, 3, SQTrue, SQFalse))) {
  669. if(!sq_isstring( v->_lasterror))
  670. v->Raise_Error(_SC("compare func failed"));
  671. return false;
  672. }
  673. if(SQ_FAILED(sq_getinteger(v, -1, &ret))) {
  674. v->Raise_Error(_SC("numeric value expected as return value of the compare function"));
  675. return false;
  676. }
  677. sq_settop(v, top);
  678. return true;
  679. }
  680. return true;
  681. }
  682. bool _hsort_sift_down(HSQUIRRELVM v,SQArray *arr, SQInteger root, SQInteger bottom, SQInteger func)
  683. {
  684. SQInteger maxChild;
  685. SQInteger done = 0;
  686. SQInteger ret;
  687. SQInteger root2;
  688. while (((root2 = root * 2) <= bottom) && (!done))
  689. {
  690. if (root2 == bottom) {
  691. maxChild = root2;
  692. }
  693. else {
  694. if(!_sort_compare(v,arr->_values[root2],arr->_values[root2 + 1],func,ret))
  695. return false;
  696. if (ret > 0) {
  697. maxChild = root2;
  698. }
  699. else {
  700. maxChild = root2 + 1;
  701. }
  702. }
  703. if(!_sort_compare(v,arr->_values[root],arr->_values[maxChild],func,ret))
  704. return false;
  705. if (ret < 0) {
  706. if (root == maxChild) {
  707. v->Raise_Error(_SC("inconsistent compare function"));
  708. return false; // We'd be swapping ourselve. The compare function is incorrect
  709. }
  710. _Swap(arr->_values[root],arr->_values[maxChild]);
  711. root = maxChild;
  712. }
  713. else {
  714. done = 1;
  715. }
  716. }
  717. return true;
  718. }
  719. bool _hsort(HSQUIRRELVM v,SQObjectPtr &arr, SQInteger l, SQInteger r,SQInteger func)
  720. {
  721. SQArray *a = _array(arr);
  722. SQInteger i;
  723. SQInteger array_size = a->Size();
  724. for (i = (array_size / 2); i >= 0; i--) {
  725. if(!_hsort_sift_down(v,a, i, array_size - 1,func)) return false;
  726. }
  727. for (i = array_size-1; i >= 1; i--)
  728. {
  729. _Swap(a->_values[0],a->_values[i]);
  730. if(!_hsort_sift_down(v,a, 0, i-1,func)) return false;
  731. }
  732. return true;
  733. }
  734. static SQInteger array_sort(HSQUIRRELVM v)
  735. {
  736. SQInteger func = -1;
  737. SQObjectPtr &o = stack_get(v,1);
  738. if(_array(o)->Size() > 1) {
  739. if(sq_gettop(v) == 2) func = 2;
  740. if(!_hsort(v, o, 0, _array(o)->Size()-1, func))
  741. return SQ_ERROR;
  742. }
  743. return 0;
  744. }
  745. static SQInteger array_slice(HSQUIRRELVM v)
  746. {
  747. SQInteger sidx,eidx;
  748. SQObjectPtr o;
  749. if(get_slice_params(v,sidx,eidx,o)==-1)return -1;
  750. SQInteger alen = _array(o)->Size();
  751. if(sidx < 0)sidx = alen + sidx;
  752. if(eidx < 0)eidx = alen + eidx;
  753. if(eidx < sidx)return sq_throwerror(v,_SC("wrong indexes"));
  754. if(eidx > alen)return sq_throwerror(v,_SC("slice out of range"));
  755. SQArray *arr=SQArray::Create(_ss(v),eidx-sidx);
  756. SQObjectPtr t;
  757. SQInteger count=0;
  758. for(SQInteger i=sidx;i<eidx;i++){
  759. _array(o)->Get(i,t);
  760. arr->Set(count++,t);
  761. }
  762. v->Push(arr);
  763. return 1;
  764. }
  765. //DAD start
  766. #include <sqstdio.h>
  767. #include <sqstdblob.h>
  768. #include "sqstdstream.h"
  769. #include "sqstdblobimpl.h"
  770. SQ_OPT_STRING_STRLEN();
  771. static SQInteger array_concat0 (HSQUIRRELVM v, int allowAll) {
  772. SQ_FUNC_VARS(v);
  773. SQInteger last = sq_getsize(v, 1);
  774. if(last == 0){
  775. sq_pushstring(v, "", 0);
  776. return 1;
  777. }
  778. SQ_OPT_STRING(v, 2, sep, "");
  779. SQ_OPT_INTEGER(v, 3, i, 0);
  780. SQ_OPT_INTEGER(v, 4, opt_last, last);
  781. last = opt_last < last ? opt_last : last;
  782. opt_last = last -1;
  783. SQBlob blob(0, 8192);
  784. for (; i < last; i++) {
  785. sq_pushinteger(v, i);
  786. sq_rawget(v, 1);
  787. SQObject o = stack_get(v,-1);
  788. switch(type(o)){
  789. case OT_STRING:
  790. break;
  791. case OT_INTEGER:
  792. case OT_FLOAT:
  793. sq_tostring(v, -1);
  794. break;
  795. case OT_NULL:
  796. sq_tostring(v, -1);
  797. break;
  798. case OT_USERDATA:
  799. if(allowAll){
  800. sq_tostring(v, -1);
  801. break;
  802. }
  803. default:
  804. return sq_throwerror(v, "Invalid type \"%s\" at position %d for array concat !", GetTypeName(o), i);
  805. }
  806. const SQChar *value;
  807. sq_getstring(v, -1, &value);
  808. SQInteger value_size = sq_getsize(v, -1);
  809. blob.Write((void*)value, value_size);
  810. if(i != opt_last) blob.Write((void*)sep, sep_size);
  811. sq_settop(v, _top_);
  812. }
  813. sq_pushstring(v, (SQChar*)blob.GetBuf(), blob.Len());
  814. return 1;
  815. }
  816. static SQInteger array_concat (HSQUIRRELVM v) {
  817. return array_concat0(v, 0);
  818. }
  819. static SQInteger array_concat2 (HSQUIRRELVM v) {
  820. return array_concat0(v, 1);
  821. }
  822. static SQInteger array_getdelegate(HSQUIRRELVM v)
  823. {
  824. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  825. }
  826. //DAD end
  827. SQRegFunction SQSharedState::_array_default_delegate_funcz[]={
  828. {_SC("len"),default_delegate_len,1, _SC("a")},
  829. {_SC("append"),array_append,2, _SC("a")},
  830. {_SC("extend"),array_extend,2, _SC("aa")},
  831. {_SC("push"),array_append,2, _SC("a")},
  832. {_SC("pop"),array_pop,1, _SC("a")},
  833. {_SC("top"),array_top,1, _SC("a")},
  834. {_SC("insert"),array_insert,3, _SC("an")},
  835. {_SC("remove"),array_remove,2, _SC("an")},
  836. {_SC("resize"),array_resize,-2, _SC("an")},
  837. {_SC("reverse"),array_reverse,1, _SC("a")},
  838. {_SC("sort"),array_sort,-1, _SC("ac")},
  839. {_SC("slice"),array_slice,-1, _SC("ann")},
  840. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  841. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  842. {_SC("clear"),obj_clear,1, _SC(".")},
  843. {_SC("map"),array_map,2, _SC("ac")},
  844. {_SC("apply"),array_apply,2, _SC("ac")},
  845. {_SC("reduce"),array_reduce,2, _SC("ac")},
  846. {_SC("filter"),array_filter,2, _SC("ac")},
  847. {_SC("find"),array_find,2, _SC("a.")},
  848. {_SC("concat"),array_concat,-1, _SC("as")},
  849. {_SC("concat2"),array_concat2,-1, _SC("as")},
  850. {_SC("getdelegate"),array_getdelegate,1, _SC(".")},
  851. {_SC("get"),container_rawget, -2, _SC("ai.")},
  852. {0,0}
  853. };
  854. //STRING DEFAULT DELEGATE//////////////////////////
  855. static SQInteger string_slice(HSQUIRRELVM v)
  856. {
  857. SQInteger sidx,eidx;
  858. SQObjectPtr o;
  859. if(SQ_FAILED(get_slice_params(v,sidx,eidx,o)))return -1;
  860. SQInteger slen = _string(o)->_len;
  861. if(sidx < 0)sidx = slen + sidx;
  862. if(eidx < 0)eidx = slen + eidx;
  863. if(eidx < sidx) return sq_throwerror(v,_SC("wrong indexes"));
  864. if(eidx > slen) return sq_throwerror(v,_SC("slice out of range"));
  865. v->Push(SQString::Create(_ss(v),&_stringval(o)[sidx],eidx-sidx));
  866. return 1;
  867. }
  868. static SQInteger string_find(HSQUIRRELVM v)
  869. {
  870. SQInteger top,start_idx=0;
  871. const SQChar *str,*substr,*ret;
  872. if(((top=sq_gettop(v))>1) && SQ_SUCCEEDED(sq_getstring(v,1,&str)) && SQ_SUCCEEDED(sq_getstring(v,2,&substr))){
  873. if(top>2)sq_getinteger(v,3,&start_idx);
  874. if((sq_getsize(v,1)>start_idx) && (start_idx>=0)){
  875. ret=scstrstr(&str[start_idx],substr);
  876. if(ret){
  877. sq_pushinteger(v,(SQInteger)(ret-str));
  878. return 1;
  879. }
  880. }
  881. return 0;
  882. }
  883. return sq_throwerror(v,_SC("invalid param"));
  884. }
  885. #define STRING_TOFUNCZ(func) static SQInteger string_##func(HSQUIRRELVM v) \
  886. { \
  887. SQObject str=stack_get(v,1); \
  888. SQInteger len=_string(str)->_len; \
  889. const SQChar *sThis=_stringval(str); \
  890. SQChar *sNew=(_ss(v)->GetScratchPad(rsl(len))); \
  891. for(SQInteger i=0;i<len;i++) sNew[i]=func(sThis[i]); \
  892. v->Push(SQString::Create(_ss(v),sNew,len)); \
  893. return 1; \
  894. }
  895. STRING_TOFUNCZ(tolower)
  896. STRING_TOFUNCZ(toupper)
  897. //DAD start
  898. #include "lua-regex.h"
  899. static int process_string_gsub(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  900. const char *str;
  901. SQInteger str_size;
  902. HSQUIRRELVM v = (HSQUIRRELVM)udata;
  903. SQObjectType rtype = sq_gettype(v, 3);
  904. SQInteger top = sq_gettop(v);
  905. int result = 1;
  906. switch(rtype){
  907. case OT_CLOSURE:{
  908. sq_push(v, 3); //push the function
  909. sq_pushroottable(v); //this
  910. int i=0;
  911. for(; i < ms->level; ++i){
  912. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  913. }
  914. int rc = sq_call(v, i+1, SQTrue, SQTrue);
  915. if(rc < 0) {
  916. ms->error = sq_getlasterror_str(v);
  917. return 0;
  918. }
  919. if(SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &str, &str_size))){
  920. if(!char_buffer_add_str(ms, b, str, str_size)) {
  921. result = 0;
  922. break;
  923. }
  924. }
  925. }
  926. break;
  927. case OT_ARRAY:{
  928. for(int i=0; i < ms->level; ++i){
  929. sq_pushinteger(v, i);
  930. if(SQ_SUCCEEDED(sq_get(v, 3)) && SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &str, &str_size))){
  931. if(!char_buffer_add_str(ms, b, str, str_size)) {
  932. result = 0;
  933. break;
  934. }
  935. sq_pop(v, 1); //remove value
  936. }
  937. }
  938. }
  939. break;
  940. case OT_TABLE:{
  941. for(int i=0; i < ms->level; ++i){
  942. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  943. if(SQ_SUCCEEDED(sq_get(v, 3)) && SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &str, &str_size))){
  944. if(!char_buffer_add_str(ms, b, str, str_size)) {
  945. result = 0;
  946. break;
  947. }
  948. sq_pop(v, 1); //remove value
  949. }
  950. }
  951. }
  952. }
  953. sq_settop(v, top); //restore the stack to it's original state
  954. return result; //returning non zero means continue
  955. }
  956. static SQInteger string_gsub(HSQUIRRELVM v)
  957. {
  958. const char *error_ptr;
  959. SQ_FUNC_VARS(v);
  960. SQ_GET_STRING(v, 1, src);
  961. SQ_GET_STRING(v, 2, pattern);
  962. SQ_OPT_INTEGER(v, 4, max_sub, 0);
  963. SQObjectType rtype = sq_gettype(v, 3);
  964. if(rtype == OT_STRING){
  965. SQ_GET_STRING(v, 3, replacement);
  966. char_buffer_st *buf = str_gsub (src, src_size, pattern, pattern_size,
  967. replacement, replacement_size, max_sub, &error_ptr, 0, 0);
  968. if(buf){
  969. sq_pushstring(v, buf->buf, buf->used);
  970. free(buf);
  971. return 1;
  972. }
  973. return sq_throwerror(v,error_ptr);
  974. }
  975. else
  976. {
  977. switch(rtype){
  978. case OT_CLOSURE:
  979. case OT_ARRAY:
  980. case OT_TABLE:{
  981. char_buffer_st *buf = str_gsub (src, src_size, pattern, pattern_size,
  982. 0, 0, max_sub, &error_ptr, process_string_gsub, v);
  983. if(buf){
  984. sq_pushstring(v, buf->buf, buf->used);
  985. free(buf);
  986. return 1;
  987. }
  988. return sq_throwerror(v,error_ptr);
  989. }
  990. }
  991. }
  992. return sq_throwerror(v,"invalid type for parameter 3 function/table/array/string expected");
  993. }
  994. static int process_string_gmatch_find(LuaMatchState *ms, void *udata, char_buffer_st **b, bool isFind) {
  995. HSQUIRRELVM v = (HSQUIRRELVM)udata;
  996. SQInteger top = sq_gettop(v);
  997. int result = 1;
  998. int i=0;
  999. sq_push(v, 3); //push the function
  1000. sq_pushroottable(v); //this en, function already on top of stack
  1001. if(isFind){
  1002. sq_pushinteger(v, ms->start_pos);
  1003. sq_pushinteger(v, ms->end_pos);
  1004. }
  1005. for(; i < ms->level; ++i){
  1006. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  1007. }
  1008. int rc = sq_call(v, i+1 + (isFind ? 2 : 0), SQTrue, SQTrue);
  1009. if(rc < 0) {
  1010. ms->error = sq_getlasterror_str(v);
  1011. return 0;
  1012. }
  1013. SQObjectType rtype = sq_gettype(v, -1);
  1014. if(rtype == OT_BOOL) {
  1015. SQBool b;
  1016. sq_getbool(v, -1, &b);
  1017. result = b == SQTrue;
  1018. }
  1019. else result = rtype != OT_NULL;
  1020. sq_settop(v, top); //restore the stack to it's original state
  1021. return result; //returning non zero means continue
  1022. }
  1023. static int process_string_gmatch(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  1024. return process_string_gmatch_find(ms, udata, b, false);
  1025. }
  1026. static SQInteger string_gmatch(HSQUIRRELVM v)
  1027. {
  1028. SQ_FUNC_VARS_NO_TOP(v);
  1029. SQ_GET_STRING(v, 1, src);
  1030. SQ_GET_STRING(v, 2, pattern);
  1031. SQInteger rtype = sq_gettype(v, 3);
  1032. if(rtype == OT_CLOSURE){
  1033. LuaMatchState ms;
  1034. memset(&ms, 0, sizeof(ms));
  1035. int rc = str_match(&ms, src, src_size, pattern, pattern_size,
  1036. 0, 0, process_string_gmatch, v);
  1037. if(ms.error) return sq_throwerror(v, ms.error);
  1038. sq_pushinteger(v, rc);
  1039. return 1;
  1040. }
  1041. return sq_throwerror(v,"invalid type for parameter 3 function expected");
  1042. }
  1043. static int process_string_find_lua(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  1044. return process_string_gmatch_find(ms, udata, b, true);
  1045. }
  1046. static SQInteger string_find_lua(HSQUIRRELVM v)
  1047. {
  1048. SQ_FUNC_VARS(v);
  1049. SQ_GET_STRING(v, 1, src);
  1050. SQ_GET_STRING(v, 2, pattern);
  1051. SQ_OPT_INTEGER(v, 4, start, 0);
  1052. SQ_OPT_BOOL(v, 5, raw, SQFalse);
  1053. SQInteger rtype = sq_gettype(v, 3);
  1054. if(rtype == OT_CLOSURE){
  1055. LuaMatchState ms;
  1056. memset(&ms, 0, sizeof(ms));
  1057. int rc = str_find(&ms, src, src_size, pattern, pattern_size,
  1058. start, raw == SQTrue, process_string_find_lua, v);
  1059. if(ms.error) return sq_throwerror(v, ms.error);
  1060. sq_pushinteger(v, rc);
  1061. return 1;
  1062. }
  1063. else if(rtype == OT_TABLE || rtype == OT_ARRAY){
  1064. LuaMatchState ms;
  1065. memset(&ms, 0, sizeof(ms));
  1066. int rc = str_find(&ms, src, src_size, pattern, pattern_size,
  1067. start, raw == SQTrue, 0, 0);
  1068. if(ms.error) return sq_throwerror(v, ms.error);
  1069. if(rtype == OT_TABLE){
  1070. sq_pushstring(v, _SC("start_pos"), -1);
  1071. sq_pushinteger(v, ms.start_pos);
  1072. sq_rawset(v, 3);
  1073. sq_pushstring(v, _SC("end_pos"), -1);
  1074. sq_pushinteger(v, ms.end_pos);
  1075. sq_rawset(v, 3);
  1076. }
  1077. else if(rtype == OT_ARRAY)
  1078. {
  1079. sq_pushinteger(v, 0);
  1080. sq_pushinteger(v, ms.start_pos);
  1081. sq_rawset(v, 3);
  1082. sq_pushinteger(v, 1);
  1083. sq_pushinteger(v, ms.end_pos);
  1084. sq_rawset(v, 3);
  1085. }
  1086. sq_pushinteger(v, rc);
  1087. return 1;
  1088. }
  1089. return sq_throwerror(v,"invalid type for parameter 3 function expected");
  1090. }
  1091. static const SQChar *lmemfind (const SQChar *s1, size_t l1,
  1092. const SQChar *s2, size_t l2) {
  1093. if (l2 == 0) return s1; /* empty strings are everywhere */
  1094. else if (l2 > l1) return NULL; /* avoids a negative `l1' */
  1095. else {
  1096. const SQChar *init; /* to search for a `*s2' inside `s1' */
  1097. l2--; /* 1st char will be checked by `memchr' */
  1098. l1 = l1-l2; /* `s2' cannot be found after that */
  1099. while (l1 > 0 && (init = (const SQChar *)memchr(s1, *s2, l1)) != NULL) {
  1100. init++; /* 1st char is already checked */
  1101. if (memcmp(init, s2+1, l2) == 0)
  1102. return init-1;
  1103. else { /* correct `l1' and `s1' to try again */
  1104. l1 -= init-s1;
  1105. s1 = init;
  1106. }
  1107. }
  1108. return NULL; /* not found */
  1109. }
  1110. }
  1111. /*DAD */
  1112. static SQInteger string_replace(HSQUIRRELVM v) {
  1113. SQ_FUNC_VARS_NO_TOP(v);
  1114. SQ_GET_STRING(v, 1, src);
  1115. SQ_GET_STRING(v, 2, p);
  1116. SQ_GET_STRING(v, 3, p2);
  1117. const SQChar *s2;
  1118. int n = 0;
  1119. int init = 0;
  1120. SQBlob b(0, 8192);
  1121. while (1) {
  1122. s2 = lmemfind(src+init, src_size-init, p, p_size);
  1123. if (s2) {
  1124. b.Write(src+init, s2-(src+init));
  1125. b.Write(p2, p2_size);
  1126. init = init + (s2-(src+init)) + p_size;
  1127. n++;
  1128. } else {
  1129. b.Write(src+init, src_size-init);
  1130. break;
  1131. }
  1132. }
  1133. sq_pushstring(v, (const SQChar*)b.GetBuf(), b.Len());
  1134. return 1;
  1135. }
  1136. static SQInteger string_find_close_quote(HSQUIRRELVM v) {
  1137. SQ_FUNC_VARS(v);
  1138. SQ_GET_STRING(v, 1, src);
  1139. SQ_OPT_INTEGER(v, 2, init, 0);
  1140. if(init >= src_size) return sq_throwerror(v, _SC("invalid start position"));
  1141. for(; init < src_size; ++init) {
  1142. if(src[init] == '"'){
  1143. if(src[init+1] == '"') ++init; //skip quoted quote
  1144. else break;
  1145. }
  1146. }
  1147. if(src[init] != '"') init = -1;
  1148. sq_pushinteger(v, init);
  1149. return 1;
  1150. }
  1151. static SQInteger string_getdelegate(HSQUIRRELVM v)
  1152. {
  1153. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  1154. }
  1155. //DAD end
  1156. SQRegFunction SQSharedState::_string_default_delegate_funcz[]={
  1157. {_SC("len"),default_delegate_len,1, _SC("s")},
  1158. {_SC("tointeger"),default_delegate_tointeger,-1, _SC("sn")},
  1159. {_SC("tofloat"),default_delegate_tofloat,1, _SC("s")},
  1160. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1161. {_SC("slice"),string_slice,-1, _SC(" s n n")},
  1162. {_SC("replace"),string_replace,3, _SC("sss")},
  1163. {_SC("find"),string_find,-2, _SC("s s n ")},
  1164. {_SC("find_lua"),string_find_lua,-3, _SC("ss a|t|c nb")},
  1165. {_SC("find_close_quote"),string_find_close_quote,-1, _SC("sn")},
  1166. {_SC("gsub"),string_gsub,-3, _SC("s s s|a|t|c n")},
  1167. {_SC("gmatch"),string_gmatch, 3, _SC("s s c")},
  1168. {_SC("tolower"),string_tolower,1, _SC("s")},
  1169. {_SC("toupper"),string_toupper,1, _SC("s")},
  1170. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1171. {_SC("getdelegate"),string_getdelegate,1, _SC(".")},
  1172. {0,0}
  1173. };
  1174. //INTEGER DEFAULT DELEGATE//////////////////////////
  1175. static SQInteger number_getdelegate(HSQUIRRELVM v)
  1176. {
  1177. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  1178. }
  1179. SQRegFunction SQSharedState::_number_default_delegate_funcz[]={
  1180. {_SC("tointeger"),default_delegate_tointeger,1, _SC("n|b")},
  1181. {_SC("tofloat"),default_delegate_tofloat,1, _SC("n|b")},
  1182. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1183. {_SC("tochar"),number_delegate_tochar,1, _SC("n|b")},
  1184. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1185. {_SC("getdelegate"),number_getdelegate,1, _SC(".")},
  1186. {0,0}
  1187. };
  1188. //CLOSURE DEFAULT DELEGATE//////////////////////////
  1189. static SQInteger closure_pcall(HSQUIRRELVM v)
  1190. {
  1191. return SQ_SUCCEEDED(sq_call(v,sq_gettop(v)-1,SQTrue,SQFalse))?1:SQ_ERROR;
  1192. }
  1193. static SQInteger closure_call(HSQUIRRELVM v)
  1194. {
  1195. return SQ_SUCCEEDED(sq_call(v,sq_gettop(v)-1,SQTrue,SQTrue))?1:SQ_ERROR;
  1196. }
  1197. static SQInteger _closure_acall(HSQUIRRELVM v,SQBool raiseerror, SQBool v2)
  1198. {
  1199. SQArray *aparams=_array(stack_get(v, v2 ? 3 : 2));
  1200. SQInteger nparams=aparams->Size();
  1201. v->Push(stack_get(v,1));
  1202. if(v2) v->Push(stack_get(v,2));
  1203. for(SQInteger i=0;i<nparams;i++)v->Push(aparams->_values[i]);
  1204. return SQ_SUCCEEDED(sq_call(v,nparams + (v2 ? 1 : 0),SQTrue,raiseerror))?1:SQ_ERROR;
  1205. }
  1206. static SQInteger closure_acall(HSQUIRRELVM v)
  1207. {
  1208. return _closure_acall(v,SQTrue, SQFalse);
  1209. }
  1210. static SQInteger closure_acall2(HSQUIRRELVM v)
  1211. {
  1212. return _closure_acall(v,SQTrue, SQTrue);
  1213. }
  1214. static SQInteger closure_pacall(HSQUIRRELVM v)
  1215. {
  1216. return _closure_acall(v,SQFalse, SQFalse);
  1217. }
  1218. static SQInteger closure_bindenv(HSQUIRRELVM v)
  1219. {
  1220. if(SQ_FAILED(sq_bindenv(v,1)))
  1221. return SQ_ERROR;
  1222. return 1;
  1223. }
  1224. static SQInteger closure_getinfos(HSQUIRRELVM v) {
  1225. SQObject o = stack_get(v,1);
  1226. SQTable *res = SQTable::Create(_ss(v),4);
  1227. if(type(o) == OT_CLOSURE) {
  1228. SQFunctionProto *f = _closure(o)->_function;
  1229. SQInteger nparams = f->_nparameters + (f->_varparams?1:0);
  1230. SQObjectPtr params = SQArray::Create(_ss(v),nparams);
  1231. SQObjectPtr defparams = SQArray::Create(_ss(v),f->_ndefaultparams);
  1232. for(SQInteger n = 0; n<f->_nparameters; n++) {
  1233. _array(params)->Set((SQInteger)n,f->_parameters[n]);
  1234. }
  1235. for(SQInteger j = 0; j<f->_ndefaultparams; j++) {
  1236. _array(defparams)->Set((SQInteger)j,_closure(o)->_defaultparams[j]);
  1237. }
  1238. if(f->_varparams) {
  1239. _array(params)->Set(nparams-1,SQString::Create(_ss(v),_SC("..."),-1));
  1240. }
  1241. res->NewSlot(SQString::Create(_ss(v),_SC("native"),-1),false);
  1242. res->NewSlot(SQString::Create(_ss(v),_SC("name"),-1),f->_name);
  1243. res->NewSlot(SQString::Create(_ss(v),_SC("src"),-1),f->_sourcename);
  1244. res->NewSlot(SQString::Create(_ss(v),_SC("parameters"),-1),params);
  1245. res->NewSlot(SQString::Create(_ss(v),_SC("varargs"),-1),f->_varparams);
  1246. res->NewSlot(SQString::Create(_ss(v),_SC("defparams"),-1),defparams);
  1247. }
  1248. else { //OT_NATIVECLOSURE
  1249. SQNativeClosure *nc = _nativeclosure(o);
  1250. res->NewSlot(SQString::Create(_ss(v),_SC("native"),-1),true);
  1251. res->NewSlot(SQString::Create(_ss(v),_SC("name"),-1),nc->_name);
  1252. res->NewSlot(SQString::Create(_ss(v),_SC("paramscheck"),-1),nc->_nparamscheck);
  1253. SQObjectPtr typecheck;
  1254. if(nc->_typecheck.size() > 0) {
  1255. typecheck =
  1256. SQArray::Create(_ss(v), nc->_typecheck.size());
  1257. for(SQUnsignedInteger n = 0; n<nc->_typecheck.size(); n++) {
  1258. _array(typecheck)->Set((SQInteger)n,nc->_typecheck[n]);
  1259. }
  1260. }
  1261. res->NewSlot(SQString::Create(_ss(v),_SC("typecheck"),-1),typecheck);
  1262. }
  1263. v->Push(res);
  1264. return 1;
  1265. }
  1266. SQRegFunction SQSharedState::_closure_default_delegate_funcz[]={
  1267. {_SC("call"),closure_call,-1, _SC("c")},
  1268. {_SC("pcall"),closure_pcall,-1, _SC("c")},
  1269. {_SC("acall"),closure_acall,2, _SC("ca")},
  1270. {_SC("acall2"),closure_acall2,3, _SC("c.a")},
  1271. {_SC("pacall"),closure_pacall,2, _SC("ca")},
  1272. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1273. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1274. {_SC("bindenv"),closure_bindenv,2, _SC("c x|y|t")},
  1275. {_SC("getinfos"),closure_getinfos,1, _SC("c")},
  1276. {0,0}
  1277. };
  1278. //GENERATOR DEFAULT DELEGATE
  1279. static SQInteger generator_getstatus(HSQUIRRELVM v)
  1280. {
  1281. SQObject &o=stack_get(v,1);
  1282. switch(_generator(o)->_state){
  1283. case SQGenerator::eSuspended:v->Push(SQString::Create(_ss(v),_SC("suspended")));break;
  1284. case SQGenerator::eRunning:v->Push(SQString::Create(_ss(v),_SC("running")));break;
  1285. case SQGenerator::eDead:v->Push(SQString::Create(_ss(v),_SC("dead")));break;
  1286. }
  1287. return 1;
  1288. }
  1289. SQRegFunction SQSharedState::_generator_default_delegate_funcz[]={
  1290. {_SC("getstatus"),generator_getstatus,1, _SC("g")},
  1291. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1292. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1293. {0,0}
  1294. };
  1295. //THREAD DEFAULT DELEGATE
  1296. static SQInteger thread_call(HSQUIRRELVM v)
  1297. {
  1298. SQObjectPtr o = stack_get(v,1);
  1299. if(type(o) == OT_THREAD) {
  1300. SQInteger nparams = sq_gettop(v);
  1301. _thread(o)->Push(_thread(o)->_roottable);
  1302. for(SQInteger i = 2; i<(nparams+1); i++)
  1303. sq_move(_thread(o),v,i);
  1304. if(SQ_SUCCEEDED(sq_call(_thread(o),nparams,SQTrue,SQTrue))) {
  1305. sq_move(v,_thread(o),-1);
  1306. sq_pop(_thread(o),1);
  1307. return 1;
  1308. }
  1309. v->_lasterror = _thread(o)->_lasterror;
  1310. return SQ_ERROR;
  1311. }
  1312. return sq_throwerror(v,_SC("wrong parameter"));
  1313. }
  1314. static SQInteger thread_wakeup(HSQUIRRELVM v)
  1315. {
  1316. SQObjectPtr o = stack_get(v,1);
  1317. if(type(o) == OT_THREAD) {
  1318. SQVM *thread = _thread(o);
  1319. SQInteger state = sq_getvmstate(thread);
  1320. if(state != SQ_VMSTATE_SUSPENDED) {
  1321. switch(state) {
  1322. case SQ_VMSTATE_IDLE:
  1323. return sq_throwerror(v,_SC("cannot wakeup a idle thread"));
  1324. break;
  1325. case SQ_VMSTATE_RUNNING:
  1326. return sq_throwerror(v,_SC("cannot wakeup a running thread"));
  1327. break;
  1328. }
  1329. }
  1330. SQInteger wakeupret = sq_gettop(v)>1?1:0;
  1331. if(wakeupret) {
  1332. sq_move(thread,v,2);
  1333. }
  1334. if(SQ_SUCCEEDED(sq_wakeupvm(thread,wakeupret,SQTrue,SQTrue,SQFalse))) {
  1335. sq_move(v,thread,-1);
  1336. sq_pop(thread,1); //pop retval
  1337. if(sq_getvmstate(thread) == SQ_VMSTATE_IDLE) {
  1338. sq_settop(thread,1); //pop roottable
  1339. }
  1340. return 1;
  1341. }
  1342. sq_settop(thread,1);
  1343. v->_lasterror = thread->_lasterror;
  1344. return SQ_ERROR;
  1345. }
  1346. return sq_throwerror(v,_SC("wrong parameter"));
  1347. }
  1348. static SQInteger thread_getstatus(HSQUIRRELVM v)
  1349. {
  1350. SQObjectPtr &o = stack_get(v,1);
  1351. switch(sq_getvmstate(_thread(o))) {
  1352. case SQ_VMSTATE_IDLE:
  1353. sq_pushstring(v,_SC("idle"),-1);
  1354. break;
  1355. case SQ_VMSTATE_RUNNING:
  1356. sq_pushstring(v,_SC("running"),-1);
  1357. break;
  1358. case SQ_VMSTATE_SUSPENDED:
  1359. sq_pushstring(v,_SC("suspended"),-1);
  1360. break;
  1361. default:
  1362. return sq_throwerror(v,_SC("internal VM error"));
  1363. }
  1364. return 1;
  1365. }
  1366. static SQInteger thread_getstackinfos(HSQUIRRELVM v)
  1367. {
  1368. SQObjectPtr o = stack_get(v,1);
  1369. if(type(o) == OT_THREAD) {
  1370. SQVM *thread = _thread(o);
  1371. SQInteger threadtop = sq_gettop(thread);
  1372. SQInteger level;
  1373. sq_getinteger(v,-1,&level);
  1374. SQRESULT res = __getcallstackinfos(thread,level);
  1375. if(SQ_FAILED(res))
  1376. {
  1377. sq_settop(thread,threadtop);
  1378. if(type(thread->_lasterror) == OT_STRING) {
  1379. sq_throwerror(v,_stringval(thread->_lasterror));
  1380. }
  1381. else {
  1382. sq_throwerror(v,_SC("unknown error"));
  1383. }
  1384. }
  1385. if(res > 0) {
  1386. //some result
  1387. sq_move(v,thread,-1);
  1388. sq_settop(thread,threadtop);
  1389. return 1;
  1390. }
  1391. //no result
  1392. sq_settop(thread,threadtop);
  1393. return 0;
  1394. }
  1395. return sq_throwerror(v,_SC("wrong parameter"));
  1396. }
  1397. SQRegFunction SQSharedState::_thread_default_delegate_funcz[] = {
  1398. {_SC("call"), thread_call, -1, _SC("v")},
  1399. {_SC("wakeup"), thread_wakeup, -1, _SC("v")},
  1400. {_SC("getstatus"), thread_getstatus, 1, _SC("v")},
  1401. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1402. {_SC("getstackinfos"),thread_getstackinfos,2, _SC("vn")},
  1403. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1404. {0,0},
  1405. };
  1406. static SQInteger class_getattributes(HSQUIRRELVM v)
  1407. {
  1408. return SQ_SUCCEEDED(sq_getattributes(v,-2))?1:SQ_ERROR;
  1409. }
  1410. static SQInteger class_setattributes(HSQUIRRELVM v)
  1411. {
  1412. return SQ_SUCCEEDED(sq_setattributes(v,-3))?1:SQ_ERROR;
  1413. }
  1414. static SQInteger class_instance(HSQUIRRELVM v)
  1415. {
  1416. return SQ_SUCCEEDED(sq_createinstance(v,-1))?1:SQ_ERROR;
  1417. }
  1418. static SQInteger class_getbase(HSQUIRRELVM v)
  1419. {
  1420. return SQ_SUCCEEDED(sq_getbase(v,-1))?1:SQ_ERROR;
  1421. }
  1422. static SQInteger class_newmember(HSQUIRRELVM v)
  1423. {
  1424. SQInteger top = sq_gettop(v);
  1425. SQBool bstatic = SQFalse;
  1426. if(top == 5)
  1427. {
  1428. sq_tobool(v,-1,&bstatic);
  1429. sq_pop(v,1);
  1430. }
  1431. if(top < 4) {
  1432. sq_pushnull(v);
  1433. }
  1434. return SQ_SUCCEEDED(sq_newmember(v,-4,bstatic))?1:SQ_ERROR;
  1435. }
  1436. static SQInteger class_rawnewmember(HSQUIRRELVM v)
  1437. {
  1438. SQInteger top = sq_gettop(v);
  1439. SQBool bstatic = SQFalse;
  1440. if(top == 5)
  1441. {
  1442. sq_tobool(v,-1,&bstatic);
  1443. sq_pop(v,1);
  1444. }
  1445. if(top < 4) {
  1446. sq_pushnull(v);
  1447. }
  1448. return SQ_SUCCEEDED(sq_rawnewmember(v,-4,bstatic))?1:SQ_ERROR;
  1449. }
  1450. static SQInteger class_getdelegate(HSQUIRRELVM v)
  1451. {
  1452. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  1453. }
  1454. SQRegFunction SQSharedState::_class_default_delegate_funcz[] = {
  1455. {_SC("getattributes"), class_getattributes, 2, _SC("y.")},
  1456. {_SC("setattributes"), class_setattributes, 3, _SC("y..")},
  1457. {_SC("get"),container_get,-2, _SC("y")},
  1458. {_SC("rawget"),container_rawget,-2, _SC("y")},
  1459. {_SC("rawset"),container_rawset,3, _SC("y")},
  1460. {_SC("rawin"),container_rawexists,2, _SC("y")},
  1461. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1462. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1463. {_SC("instance"),class_instance,1, _SC("y")},
  1464. {_SC("getbase"),class_getbase,1, _SC("y")},
  1465. {_SC("newmember"),class_newmember,-3, _SC("y")},
  1466. {_SC("rawnewmember"),class_rawnewmember,-3, _SC("y")},
  1467. {_SC("getdelegate"),class_getdelegate,1, _SC(".")},
  1468. {0,0}
  1469. };
  1470. static SQInteger instance_getclass(HSQUIRRELVM v)
  1471. {
  1472. if(SQ_SUCCEEDED(sq_getclass(v,1)))
  1473. return 1;
  1474. return SQ_ERROR;
  1475. }
  1476. SQRegFunction SQSharedState::_instance_default_delegate_funcz[] = {
  1477. {_SC("getclass"), instance_getclass, 1, _SC("x")},
  1478. {_SC("get"),container_get,-2, _SC("x")},
  1479. {_SC("rawget"),container_rawget,-2, _SC("x")},
  1480. {_SC("rawset"),container_rawset,3, _SC("x")},
  1481. {_SC("rawin"),container_rawexists,2, _SC("x")},
  1482. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1483. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1484. {0,0}
  1485. };
  1486. static SQInteger weakref_ref(HSQUIRRELVM v)
  1487. {
  1488. if(SQ_FAILED(sq_getweakrefval(v,1)))
  1489. return SQ_ERROR;
  1490. return 1;
  1491. }
  1492. SQRegFunction SQSharedState::_weakref_default_delegate_funcz[] = {
  1493. {_SC("ref"),weakref_ref,1, _SC("r")},
  1494. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1495. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1496. {0,0}
  1497. };