sqbaselib.cpp 45 KB

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