sqbaselib.cpp 48 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813
  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. static SQInteger base_str_from_chars (HSQUIRRELVM v) {
  267. SQ_FUNC_VARS_NO_TOP(v);
  268. SQInteger n = sq_gettop(v); /* number of arguments */
  269. int i;
  270. SQChar *data = sq_getscratchpad(v, n);
  271. for (i=2; i<=n; ++i) {
  272. SQ_GET_INTEGER(v, i, c);
  273. if(uchar(c) != c){
  274. return sq_throwerror(v, "invalid value for parameter %d", i);
  275. }
  276. data[i-2] = uchar(c);
  277. }
  278. sq_pushstring(v, data, n-1);
  279. return 1;
  280. }
  281. static SQRegFunction base_funcs[]={
  282. //generic
  283. {_SC("seterrorhandler"),base_seterrorhandler,2, NULL},
  284. {_SC("setdebughook"),base_setdebughook,2, NULL},
  285. {_SC("enabledebuginfo"),base_enabledebuginfo,2, NULL},
  286. {_SC("getstackinfos"),base_getstackinfos,2, _SC(".n")},
  287. {_SC("getstacktop"),base_getstacktop,1, _SC(".")},
  288. {_SC("getroottable"),base_getroottable,1, NULL},
  289. {_SC("setroottable"),base_setroottable,2, NULL},
  290. {_SC("getconsttable"),base_getconsttable,1, NULL},
  291. {_SC("setconsttable"),base_setconsttable,2, NULL},
  292. {_SC("assert"),base_assert,2, NULL},
  293. {_SC("print1"),base_print1,2, NULL},
  294. {_SC("print"),base_print,-2, NULL},
  295. {_SC("error"),base_error,2, NULL},
  296. {_SC("get_last_error"),base_get_last_error,1, NULL},
  297. {_SC("compilestring"),base_compilestring,-2, _SC(".ss")},
  298. {_SC("newthread"),base_newthread,2, _SC(".c")},
  299. {_SC("suspend"),base_suspend,-1, NULL},
  300. {_SC("array"),base_array,-2, _SC(".n")},
  301. {_SC("type"),base_type,2, NULL},
  302. {_SC("callee"),base_callee,0,NULL},
  303. {_SC("dummy"),base_dummy,0,NULL},
  304. #ifndef NO_GARBAGE_COLLECTOR
  305. {_SC("collectgarbage"),base_collectgarbage,0, NULL},
  306. {_SC("resurrectunreachable"),base_resurectureachable,0, NULL},
  307. {_SC("str_from_chars"),base_str_from_chars,-2, _SC(".i")},
  308. #endif
  309. {0,0}
  310. };
  311. void sq_base_register(HSQUIRRELVM v)
  312. {
  313. SQInteger i=0;
  314. sq_pushroottable(v);
  315. while(base_funcs[i].name!=0) {
  316. sq_pushstring(v,base_funcs[i].name,-1);
  317. sq_newclosure(v,base_funcs[i].f,0);
  318. sq_setnativeclosurename(v,-1,base_funcs[i].name);
  319. sq_setparamscheck(v,base_funcs[i].nparamscheck,base_funcs[i].typemask);
  320. sq_newslot(v,-3, SQFalse);
  321. i++;
  322. }
  323. sq_pushstring(v,_SC("_versionnumber_"),-1);
  324. sq_pushinteger(v,SQUIRREL_VERSION_NUMBER);
  325. sq_newslot(v,-3, SQFalse);
  326. sq_pushstring(v,_SC("_version_"),-1);
  327. sq_pushstring(v,SQUIRREL_VERSION,-1);
  328. sq_newslot(v,-3, SQFalse);
  329. sq_pushstring(v,_SC("_charsize_"),-1);
  330. sq_pushinteger(v,sizeof(SQChar));
  331. sq_newslot(v,-3, SQFalse);
  332. sq_pushstring(v,_SC("_intsize_"),-1);
  333. sq_pushinteger(v,sizeof(SQInteger));
  334. sq_newslot(v,-3, SQFalse);
  335. sq_pushstring(v,_SC("_floatsize_"),-1);
  336. sq_pushinteger(v,sizeof(SQFloat));
  337. sq_newslot(v,-3, SQFalse);
  338. sq_pop(v,1);
  339. }
  340. static SQInteger default_delegate_len(HSQUIRRELVM v)
  341. {
  342. v->Push(SQInteger(sq_getsize(v,1)));
  343. return 1;
  344. }
  345. static SQInteger default_delegate_tofloat(HSQUIRRELVM v)
  346. {
  347. SQObjectPtr &o=stack_get(v,1);
  348. switch(type(o)){
  349. case OT_STRING:{
  350. SQObjectPtr res;
  351. if(str2num(_stringval(o),res)){
  352. v->Push(SQObjectPtr(tofloat(res)));
  353. break;
  354. }}
  355. return sq_throwerror(v, _SC("cannot convert the string"));
  356. break;
  357. case OT_INTEGER:case OT_FLOAT:
  358. v->Push(SQObjectPtr(tofloat(o)));
  359. break;
  360. case OT_BOOL:
  361. v->Push(SQObjectPtr((SQFloat)(_integer(o)?1:0)));
  362. break;
  363. default:
  364. v->PushNull();
  365. break;
  366. }
  367. return 1;
  368. }
  369. static SQInteger default_delegate_tointeger(HSQUIRRELVM v)
  370. {
  371. SQObjectPtr &o=stack_get(v,1);
  372. switch(type(o)){
  373. case OT_STRING:{
  374. SQObjectPtr res;
  375. SQInteger base;
  376. if(sq_gettop(v) > 1){
  377. if(sq_getinteger(v, 2, &base) < 0) return sq_throwerror(v, "parameter integer expected (2-36)");
  378. if(base < 2 || base > 36) return sq_throwerror(v, "invalid base \"%d\" to tointeger (2-36)", base);
  379. }
  380. else base = 10;
  381. if(str2num(_stringval(o),res, base)){
  382. v->Push(SQObjectPtr(tointeger(res)));
  383. break;
  384. }}
  385. return sq_throwerror(v, _SC("cannot convert the string"));
  386. break;
  387. case OT_INTEGER:case OT_FLOAT:
  388. v->Push(SQObjectPtr(tointeger(o)));
  389. break;
  390. case OT_BOOL:
  391. v->Push(SQObjectPtr(_integer(o)?(SQInteger)1:(SQInteger)0));
  392. break;
  393. default:
  394. v->PushNull();
  395. break;
  396. }
  397. return 1;
  398. }
  399. static SQInteger default_delegate_tostring(HSQUIRRELVM v)
  400. {
  401. sq_tostring(v,1);
  402. return 1;
  403. }
  404. static SQInteger obj_delegate_weakref(HSQUIRRELVM v)
  405. {
  406. sq_weakref(v,1);
  407. return 1;
  408. }
  409. static SQInteger obj_clear(HSQUIRRELVM v)
  410. {
  411. return sq_clear(v,-1);
  412. }
  413. static SQInteger number_delegate_tochar(HSQUIRRELVM v)
  414. {
  415. SQObject &o=stack_get(v,1);
  416. SQChar c = (SQChar)tointeger(o);
  417. v->Push(SQString::Create(_ss(v),(const SQChar *)&c,1));
  418. return 1;
  419. }
  420. /////////////////////////////////////////////////////////////////
  421. //TABLE DEFAULT DELEGATE
  422. static SQInteger table_rawdelete(HSQUIRRELVM v)
  423. {
  424. if(SQ_FAILED(sq_rawdeleteslot(v,1,SQTrue)))
  425. return SQ_ERROR;
  426. return 1;
  427. }
  428. static SQInteger container_rawexists(HSQUIRRELVM v)
  429. {
  430. if(SQ_SUCCEEDED(sq_rawget(v,-2))) {
  431. sq_pushbool(v,SQTrue);
  432. return 1;
  433. }
  434. sq_pushbool(v,SQFalse);
  435. return 1;
  436. }
  437. static SQInteger container_rawset(HSQUIRRELVM v)
  438. {
  439. return sq_rawset(v,-3);
  440. }
  441. static SQInteger container_rawget(HSQUIRRELVM v)
  442. {
  443. switch(sq_gettop(v)){
  444. case 2: return SQ_SUCCEEDED(sq_rawget(v,-2))?1:SQ_ERROR;break;
  445. case 3: {
  446. sq_push(v, 2); //copy key to top
  447. sq_rawget(v,-4); //if it fail pop the key and default value is on top
  448. return 1;
  449. }
  450. break;
  451. }
  452. return sq_throwerror(v, _SC("invalid number of parameters"));
  453. }
  454. static SQInteger container_get(HSQUIRRELVM v)
  455. {
  456. switch(sq_gettop(v)){
  457. case 2: return SQ_SUCCEEDED(sq_get(v,-2))?1:SQ_ERROR;break;
  458. case 3: {
  459. sq_push(v, 2); //copy key to top
  460. sq_get(v,-4); //if it fail pop the key and default value is on top
  461. return 1;
  462. }
  463. break;
  464. }
  465. return sq_throwerror(v, _SC("invalid number of parameters"));
  466. }
  467. static SQInteger table_setdelegate(HSQUIRRELVM v)
  468. {
  469. if(SQ_FAILED(sq_setdelegate(v,-2)))
  470. return SQ_ERROR;
  471. sq_push(v,-1); // -1 because sq_setdelegate pops 1
  472. return 1;
  473. }
  474. static SQInteger table_getdelegate(HSQUIRRELVM v)
  475. {
  476. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  477. }
  478. SQRegFunction SQSharedState::_table_default_delegate_funcz[]={
  479. {_SC("len"),default_delegate_len,1, _SC("t")},
  480. {_SC("size"),default_delegate_len,1, _SC("t")},
  481. {_SC("get"),container_get,-2, _SC("t")},
  482. {_SC("rawget"),container_rawget,-2, _SC("t")},
  483. {_SC("rawset"),container_rawset,3, _SC("t")},
  484. {_SC("rawdelete"),table_rawdelete,2, _SC("t")},
  485. {_SC("rawin"),container_rawexists,2, _SC("t")},
  486. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  487. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  488. {_SC("clear"),obj_clear,1, _SC(".")},
  489. {_SC("setdelegate"),table_setdelegate,2, _SC(".t|o")},
  490. {_SC("getdelegate"),table_getdelegate,1, _SC(".")},
  491. {0,0}
  492. };
  493. //ARRAY DEFAULT DELEGATE///////////////////////////////////////
  494. static SQInteger array_append(HSQUIRRELVM v)
  495. {
  496. return sq_arrayappend(v,-2);
  497. }
  498. static SQInteger array_extend(HSQUIRRELVM v)
  499. {
  500. _array(stack_get(v,1))->Extend(_array(stack_get(v,2)));
  501. return 0;
  502. }
  503. static SQInteger array_reverse(HSQUIRRELVM v)
  504. {
  505. return sq_arrayreverse(v,-1);
  506. }
  507. static SQInteger array_pop(HSQUIRRELVM v)
  508. {
  509. return SQ_SUCCEEDED(sq_arraypop(v,1,SQTrue))?1:SQ_ERROR;
  510. }
  511. static SQInteger array_top(HSQUIRRELVM v)
  512. {
  513. SQObject &o=stack_get(v,1);
  514. if(_array(o)->Size()>0){
  515. v->Push(_array(o)->Top());
  516. return 1;
  517. }
  518. else return sq_throwerror(v,_SC("top() on a empty array"));
  519. }
  520. static SQInteger array_insert(HSQUIRRELVM v)
  521. {
  522. SQObject &o=stack_get(v,1);
  523. SQObject &idx=stack_get(v,2);
  524. SQObject &val=stack_get(v,3);
  525. if(!_array(o)->Insert(tointeger(idx),val))
  526. return sq_throwerror(v,_SC("index out of range"));
  527. return 0;
  528. }
  529. static SQInteger array_remove(HSQUIRRELVM v)
  530. {
  531. SQObject &o = stack_get(v, 1);
  532. SQObject &idx = stack_get(v, 2);
  533. if(!sq_isnumeric(idx)) return sq_throwerror(v, _SC("wrong type"));
  534. SQObjectPtr val;
  535. if(_array(o)->Get(tointeger(idx), val)) {
  536. _array(o)->Remove(tointeger(idx));
  537. v->Push(val);
  538. return 1;
  539. }
  540. return sq_throwerror(v, _SC("idx out of range"));
  541. }
  542. static SQInteger array_resize(HSQUIRRELVM v)
  543. {
  544. SQObject &o = stack_get(v, 1);
  545. SQObject &nsize = stack_get(v, 2);
  546. SQObjectPtr fill;
  547. if(sq_isnumeric(nsize)) {
  548. if(sq_gettop(v) > 2)
  549. fill = stack_get(v, 3);
  550. _array(o)->Resize(tointeger(nsize),fill);
  551. return 0;
  552. }
  553. return sq_throwerror(v, _SC("size must be a number"));
  554. }
  555. static SQInteger __map_array(SQArray *dest,SQArray *src,HSQUIRRELVM v) {
  556. SQObjectPtr temp;
  557. SQInteger size = src->Size();
  558. for(SQInteger n = 0; n < size; n++) {
  559. src->Get(n,temp);
  560. v->Push(src);
  561. v->Push(temp);
  562. if(SQ_FAILED(sq_call(v,2,SQTrue,SQFalse))) {
  563. return SQ_ERROR;
  564. }
  565. dest->Set(n,v->GetUp(-1));
  566. v->Pop();
  567. }
  568. return 0;
  569. }
  570. static SQInteger array_map(HSQUIRRELVM v)
  571. {
  572. SQObject &o = stack_get(v,1);
  573. SQInteger size = _array(o)->Size();
  574. SQObjectPtr ret = SQArray::Create(_ss(v),size);
  575. if(SQ_FAILED(__map_array(_array(ret),_array(o),v)))
  576. return SQ_ERROR;
  577. v->Push(ret);
  578. return 1;
  579. }
  580. static SQInteger array_apply(HSQUIRRELVM v)
  581. {
  582. SQObject &o = stack_get(v,1);
  583. if(SQ_FAILED(__map_array(_array(o),_array(o),v)))
  584. return SQ_ERROR;
  585. return 0;
  586. }
  587. static SQInteger array_reduce(HSQUIRRELVM v)
  588. {
  589. SQObject &o = stack_get(v,1);
  590. SQArray *a = _array(o);
  591. SQInteger size = a->Size();
  592. if(size == 0) {
  593. return 0;
  594. }
  595. SQObjectPtr res;
  596. a->Get(0,res);
  597. if(size > 1) {
  598. SQObjectPtr other;
  599. for(SQInteger n = 1; n < size; n++) {
  600. a->Get(n,other);
  601. v->Push(o);
  602. v->Push(res);
  603. v->Push(other);
  604. if(SQ_FAILED(sq_call(v,3,SQTrue,SQFalse))) {
  605. return SQ_ERROR;
  606. }
  607. res = v->GetUp(-1);
  608. v->Pop();
  609. }
  610. }
  611. v->Push(res);
  612. return 1;
  613. }
  614. static SQInteger array_filter(HSQUIRRELVM v)
  615. {
  616. SQObject &o = stack_get(v,1);
  617. SQArray *a = _array(o);
  618. SQObjectPtr ret = SQArray::Create(_ss(v),0);
  619. SQInteger size = a->Size();
  620. SQObjectPtr val;
  621. for(SQInteger n = 0; n < size; n++) {
  622. a->Get(n,val);
  623. v->Push(o);
  624. v->Push(n);
  625. v->Push(val);
  626. if(SQ_FAILED(sq_call(v,3,SQTrue,SQFalse))) {
  627. return SQ_ERROR;
  628. }
  629. if(!SQVM::IsFalse(v->GetUp(-1))) {
  630. _array(ret)->Append(val);
  631. }
  632. v->Pop();
  633. }
  634. v->Push(ret);
  635. return 1;
  636. }
  637. static SQInteger array_find(HSQUIRRELVM v)
  638. {
  639. SQObject &o = stack_get(v,1);
  640. SQObjectPtr &val = stack_get(v,2);
  641. SQArray *a = _array(o);
  642. SQInteger size = a->Size();
  643. SQObjectPtr temp;
  644. for(SQInteger n = 0; n < size; n++) {
  645. bool res = false;
  646. a->Get(n,temp);
  647. if(SQVM::IsEqual(temp,val,res) && res) {
  648. v->Push(n);
  649. return 1;
  650. }
  651. }
  652. return 0;
  653. }
  654. bool _sort_compare(HSQUIRRELVM v,SQObjectPtr &a,SQObjectPtr &b,SQInteger func,SQInteger &ret)
  655. {
  656. if(func < 0) {
  657. if(!v->ObjCmp(a,b,ret)) return false;
  658. }
  659. else {
  660. SQInteger top = sq_gettop(v);
  661. sq_push(v, func);
  662. sq_pushroottable(v);
  663. v->Push(a);
  664. v->Push(b);
  665. if(SQ_FAILED(sq_call(v, 3, SQTrue, SQFalse))) {
  666. if(!sq_isstring( v->_lasterror))
  667. v->Raise_Error(_SC("compare func failed"));
  668. return false;
  669. }
  670. if(SQ_FAILED(sq_getinteger(v, -1, &ret))) {
  671. v->Raise_Error(_SC("numeric value expected as return value of the compare function"));
  672. return false;
  673. }
  674. sq_settop(v, top);
  675. return true;
  676. }
  677. return true;
  678. }
  679. bool _hsort_sift_down(HSQUIRRELVM v,SQArray *arr, SQInteger root, SQInteger bottom, SQInteger func)
  680. {
  681. SQInteger maxChild;
  682. SQInteger done = 0;
  683. SQInteger ret;
  684. SQInteger root2;
  685. while (((root2 = root * 2) <= bottom) && (!done))
  686. {
  687. if (root2 == bottom) {
  688. maxChild = root2;
  689. }
  690. else {
  691. if(!_sort_compare(v,arr->_values[root2],arr->_values[root2 + 1],func,ret))
  692. return false;
  693. if (ret > 0) {
  694. maxChild = root2;
  695. }
  696. else {
  697. maxChild = root2 + 1;
  698. }
  699. }
  700. if(!_sort_compare(v,arr->_values[root],arr->_values[maxChild],func,ret))
  701. return false;
  702. if (ret < 0) {
  703. if (root == maxChild) {
  704. v->Raise_Error(_SC("inconsistent compare function"));
  705. return false; // We'd be swapping ourselve. The compare function is incorrect
  706. }
  707. _Swap(arr->_values[root],arr->_values[maxChild]);
  708. root = maxChild;
  709. }
  710. else {
  711. done = 1;
  712. }
  713. }
  714. return true;
  715. }
  716. bool _hsort(HSQUIRRELVM v,SQObjectPtr &arr, SQInteger l, SQInteger r,SQInteger func)
  717. {
  718. SQArray *a = _array(arr);
  719. SQInteger i;
  720. SQInteger array_size = a->Size();
  721. for (i = (array_size / 2); i >= 0; i--) {
  722. if(!_hsort_sift_down(v,a, i, array_size - 1,func)) return false;
  723. }
  724. for (i = array_size-1; i >= 1; i--)
  725. {
  726. _Swap(a->_values[0],a->_values[i]);
  727. if(!_hsort_sift_down(v,a, 0, i-1,func)) return false;
  728. }
  729. return true;
  730. }
  731. static SQInteger array_sort(HSQUIRRELVM v)
  732. {
  733. SQInteger func = -1;
  734. SQObjectPtr &o = stack_get(v,1);
  735. if(_array(o)->Size() > 1) {
  736. if(sq_gettop(v) == 2) func = 2;
  737. if(!_hsort(v, o, 0, _array(o)->Size()-1, func))
  738. return SQ_ERROR;
  739. }
  740. return 0;
  741. }
  742. static SQInteger array_slice(HSQUIRRELVM v)
  743. {
  744. SQInteger sidx,eidx;
  745. SQObjectPtr o;
  746. if(get_slice_params(v,sidx,eidx,o)==-1)return -1;
  747. SQInteger alen = _array(o)->Size();
  748. if(sidx < 0)sidx = alen + sidx;
  749. if(eidx < 0)eidx = alen + eidx;
  750. if(eidx < sidx)return sq_throwerror(v,_SC("wrong indexes"));
  751. if(eidx > alen)return sq_throwerror(v,_SC("slice out of range"));
  752. SQArray *arr=SQArray::Create(_ss(v),eidx-sidx);
  753. SQObjectPtr t;
  754. SQInteger count=0;
  755. for(SQInteger i=sidx;i<eidx;i++){
  756. _array(o)->Get(i,t);
  757. arr->Set(count++,t);
  758. }
  759. v->Push(arr);
  760. return 1;
  761. }
  762. //DAD start
  763. #include <sqstdio.h>
  764. #include <sqstdblob.h>
  765. #include "sqstdstream.h"
  766. #include "sqstdblobimpl.h"
  767. SQ_OPT_STRING_STRLEN();
  768. static SQInteger array_concat0 (HSQUIRRELVM v, int allowAll) {
  769. SQ_FUNC_VARS(v);
  770. SQInteger last = sq_getsize(v, 1);
  771. if(last == 0){
  772. sq_pushstring(v, "", 0);
  773. return 1;
  774. }
  775. SQ_OPT_STRING(v, 2, sep, "");
  776. SQ_OPT_INTEGER(v, 3, i, 0);
  777. SQ_OPT_INTEGER(v, 4, opt_last, last);
  778. last = opt_last < last ? opt_last : last;
  779. opt_last = last -1;
  780. SQBlob blob(0, 8192);
  781. for (; i < last; i++) {
  782. sq_pushinteger(v, i);
  783. sq_rawget(v, 1);
  784. SQObject o = stack_get(v,-1);
  785. switch(type(o)){
  786. case OT_STRING:
  787. break;
  788. case OT_INTEGER:
  789. case OT_FLOAT:
  790. sq_tostring(v, -1);
  791. break;
  792. case OT_NULL:
  793. sq_tostring(v, -1);
  794. break;
  795. case OT_USERDATA:
  796. if(allowAll){
  797. sq_tostring(v, -1);
  798. break;
  799. }
  800. default:
  801. return sq_throwerror(v, "Invalid type \"%s\" at position %d for array concat !", GetTypeName(o), i);
  802. }
  803. const SQChar *value;
  804. sq_getstring(v, -1, &value);
  805. SQInteger value_size = sq_getsize(v, -1);
  806. if(value_size < 0) return SQ_ERROR;
  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("size"),default_delegate_len,1, _SC("a")},
  828. {_SC("append"),array_append,2, _SC("a")},
  829. {_SC("extend"),array_extend,2, _SC("aa")},
  830. {_SC("push"),array_append,2, _SC("a")},
  831. {_SC("pop"),array_pop,1, _SC("a")},
  832. {_SC("top"),array_top,1, _SC("a")},
  833. {_SC("insert"),array_insert,3, _SC("an")},
  834. {_SC("remove"),array_remove,2, _SC("an")},
  835. {_SC("resize"),array_resize,-2, _SC("an")},
  836. {_SC("reverse"),array_reverse,1, _SC("a")},
  837. {_SC("sort"),array_sort,-1, _SC("ac")},
  838. {_SC("slice"),array_slice,-1, _SC("ann")},
  839. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  840. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  841. {_SC("clear"),obj_clear,1, _SC(".")},
  842. {_SC("map"),array_map,2, _SC("ac")},
  843. {_SC("apply"),array_apply,2, _SC("ac")},
  844. {_SC("reduce"),array_reduce,2, _SC("ac")},
  845. {_SC("filter"),array_filter,2, _SC("ac")},
  846. {_SC("find"),array_find,2, _SC("a.")},
  847. {_SC("concat"),array_concat,-1, _SC("as")},
  848. {_SC("concat2"),array_concat2,-1, _SC("as")},
  849. {_SC("getdelegate"),array_getdelegate,1, _SC(".")},
  850. {_SC("get"),container_rawget, -2, _SC("ai.")},
  851. {0,0}
  852. };
  853. //STRING DEFAULT DELEGATE//////////////////////////
  854. static SQRESULT string_slice(HSQUIRRELVM v)
  855. {
  856. SQInteger sidx,eidx;
  857. SQObjectPtr o;
  858. if(SQ_FAILED(get_slice_params(v,sidx,eidx,o)))return -1;
  859. SQInteger slen = _string(o)->_len;
  860. if(sidx < 0)sidx = slen + sidx;
  861. if(eidx < 0)eidx = slen + eidx;
  862. if(eidx < sidx) return sq_throwerror(v,_SC("wrong indexes"));
  863. if(eidx > slen) return sq_throwerror(v,_SC("slice out of range"));
  864. v->Push(SQString::Create(_ss(v),&_stringval(o)[sidx],eidx-sidx));
  865. return 1;
  866. }
  867. static SQRESULT string_substr(HSQUIRRELVM v)
  868. {
  869. SQ_FUNC_VARS(v);
  870. SQ_GET_INTEGER(v, 2, start);
  871. SQObjectPtr &o = stack_get(v,1);
  872. SQInteger str_size = sq_getsize(v, 1);
  873. SQ_OPT_INTEGER(v, 3, len, str_size - start);
  874. if(start < 0) return sq_throwerror(v,_SC("invalid start index %d"), start);
  875. if(len > (str_size - start)) return sq_throwerror(v,_SC("lenght out of range"));
  876. v->Push(SQString::Create(_ss(v),&_stringval(o)[start], len));
  877. return 1;
  878. }
  879. static SQRESULT string_find(HSQUIRRELVM v)
  880. {
  881. SQInteger top,start_idx=0;
  882. const SQChar *str,*substr,*ret;
  883. if(((top=sq_gettop(v))>1) && SQ_SUCCEEDED(sq_getstring(v,1,&str)) && SQ_SUCCEEDED(sq_getstring(v,2,&substr))){
  884. if(top>2)sq_getinteger(v,3,&start_idx);
  885. if((sq_getsize(v,1)>start_idx) && (start_idx>=0)){
  886. ret=scstrstr(&str[start_idx],substr);
  887. if(ret){
  888. sq_pushinteger(v,(SQInteger)(ret-str));
  889. return 1;
  890. }
  891. }
  892. return 0;
  893. }
  894. return sq_throwerror(v,_SC("invalid param"));
  895. }
  896. #define STRING_TOFUNCZ(func) static SQInteger string_##func(HSQUIRRELVM v) \
  897. { \
  898. SQObject str=stack_get(v,1); \
  899. SQInteger len=_string(str)->_len; \
  900. const SQChar *sThis=_stringval(str); \
  901. SQChar *sNew=(_ss(v)->GetScratchPad(rsl(len))); \
  902. for(SQInteger i=0;i<len;i++) sNew[i]=func(sThis[i]); \
  903. v->Push(SQString::Create(_ss(v),sNew,len)); \
  904. return 1; \
  905. }
  906. STRING_TOFUNCZ(tolower)
  907. STRING_TOFUNCZ(toupper)
  908. //DAD start
  909. #include "lua-regex.h"
  910. static int process_string_gsub(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  911. const char *str;
  912. SQInteger str_size;
  913. HSQUIRRELVM v = (HSQUIRRELVM)udata;
  914. SQObjectType rtype = sq_gettype(v, 3);
  915. SQInteger top = sq_gettop(v);
  916. int result = 1;
  917. switch(rtype){
  918. case OT_CLOSURE:{
  919. sq_push(v, 3); //push the function
  920. sq_pushroottable(v); //this
  921. int i=0;
  922. for(; i < ms->level; ++i){
  923. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  924. }
  925. int rc = sq_call(v, i+1, SQTrue, SQTrue);
  926. if(rc < 0) {
  927. ms->error = sq_getlasterror_str(v);
  928. return 0;
  929. }
  930. if(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. }
  936. }
  937. break;
  938. case OT_ARRAY:{
  939. for(int i=0; i < ms->level; ++i){
  940. sq_pushinteger(v, i);
  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. break;
  951. case OT_TABLE:{
  952. for(int i=0; i < ms->level; ++i){
  953. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  954. if(SQ_SUCCEEDED(sq_get(v, 3)) && SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &str, &str_size))){
  955. if(!char_buffer_add_str(ms, b, str, str_size)) {
  956. result = 0;
  957. break;
  958. }
  959. sq_pop(v, 1); //remove value
  960. }
  961. }
  962. }
  963. }
  964. sq_settop(v, top); //restore the stack to it's original state
  965. return result; //returning non zero means continue
  966. }
  967. static SQRESULT string_gsub(HSQUIRRELVM v)
  968. {
  969. const char *error_ptr;
  970. SQ_FUNC_VARS(v);
  971. SQ_GET_STRING(v, 1, src);
  972. SQ_GET_STRING(v, 2, pattern);
  973. SQ_OPT_INTEGER(v, 4, max_sub, 0);
  974. SQObjectType rtype = sq_gettype(v, 3);
  975. if(rtype == OT_STRING){
  976. SQ_GET_STRING(v, 3, replacement);
  977. char_buffer_st *buf = str_gsub (src, src_size, pattern, pattern_size,
  978. replacement, replacement_size, max_sub, &error_ptr, 0, 0);
  979. if(buf){
  980. sq_pushstring(v, buf->buf, buf->used);
  981. free(buf);
  982. return 1;
  983. }
  984. return sq_throwerror(v,error_ptr);
  985. }
  986. else
  987. {
  988. switch(rtype){
  989. case OT_CLOSURE:
  990. case OT_ARRAY:
  991. case OT_TABLE:{
  992. char_buffer_st *buf = str_gsub (src, src_size, pattern, pattern_size,
  993. 0, 0, max_sub, &error_ptr, process_string_gsub, v);
  994. if(buf){
  995. sq_pushstring(v, buf->buf, buf->used);
  996. free(buf);
  997. return 1;
  998. }
  999. return sq_throwerror(v,error_ptr);
  1000. }
  1001. }
  1002. }
  1003. return sq_throwerror(v,"invalid type for parameter 3 function/table/array/string expected");
  1004. }
  1005. static int process_string_gmatch_find(LuaMatchState *ms, void *udata, char_buffer_st **b, bool isFind) {
  1006. HSQUIRRELVM v = (HSQUIRRELVM)udata;
  1007. SQInteger top = sq_gettop(v);
  1008. int result = 1;
  1009. int i=0;
  1010. sq_push(v, 3); //push the function
  1011. sq_pushroottable(v); //this en, function already on top of stack
  1012. if(isFind){
  1013. sq_pushinteger(v, ms->start_pos);
  1014. sq_pushinteger(v, ms->end_pos);
  1015. }
  1016. for(; i < ms->level; ++i){
  1017. sq_pushstring(v, ms->capture[i].init, ms->capture[i].len);
  1018. }
  1019. int rc = sq_call(v, i+1 + (isFind ? 2 : 0), SQTrue, SQTrue);
  1020. if(rc < 0) {
  1021. ms->error = sq_getlasterror_str(v);
  1022. return 0;
  1023. }
  1024. SQObjectType rtype = sq_gettype(v, -1);
  1025. if(rtype == OT_BOOL) {
  1026. SQBool b;
  1027. sq_getbool(v, -1, &b);
  1028. result = b == SQTrue;
  1029. }
  1030. else result = rtype != OT_NULL;
  1031. sq_settop(v, top); //restore the stack to it's original state
  1032. return result; //returning non zero means continue
  1033. }
  1034. static int process_string_gmatch(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  1035. return process_string_gmatch_find(ms, udata, b, false);
  1036. }
  1037. static SQRESULT string_gmatch(HSQUIRRELVM v)
  1038. {
  1039. SQ_FUNC_VARS_NO_TOP(v);
  1040. SQ_GET_STRING(v, 1, src);
  1041. SQ_GET_STRING(v, 2, pattern);
  1042. SQInteger rtype = sq_gettype(v, 3);
  1043. if(rtype == OT_CLOSURE){
  1044. LuaMatchState ms;
  1045. memset(&ms, 0, sizeof(ms));
  1046. int rc = str_match(&ms, src, src_size, pattern, pattern_size,
  1047. 0, 0, process_string_gmatch, v);
  1048. if(ms.error) return sq_throwerror(v, ms.error);
  1049. sq_pushinteger(v, rc);
  1050. return 1;
  1051. }
  1052. return sq_throwerror(v,"invalid type for parameter 3 function expected");
  1053. }
  1054. static int process_string_find_lua(LuaMatchState *ms, void *udata, char_buffer_st **b) {
  1055. return process_string_gmatch_find(ms, udata, b, true);
  1056. }
  1057. static SQRESULT string_find_lua(HSQUIRRELVM v)
  1058. {
  1059. SQ_FUNC_VARS(v);
  1060. SQ_GET_STRING(v, 1, src);
  1061. SQ_GET_STRING(v, 2, pattern);
  1062. SQ_OPT_INTEGER(v, 4, start, 0);
  1063. SQ_OPT_BOOL(v, 5, raw, SQFalse);
  1064. SQInteger rtype = sq_gettype(v, 3);
  1065. if(_top_ == 2){
  1066. //only want to know if it exists
  1067. LuaMatchState ms;
  1068. memset(&ms, 0, sizeof(ms));
  1069. int rc = str_find(&ms, src, src_size, pattern, pattern_size,
  1070. start, raw == SQTrue, 0, 0);
  1071. if(ms.error) return sq_throwerror(v, ms.error);
  1072. sq_pushinteger(v, rc);
  1073. return 1;
  1074. }
  1075. if(rtype == OT_CLOSURE){
  1076. LuaMatchState ms;
  1077. memset(&ms, 0, sizeof(ms));
  1078. int rc = str_find(&ms, src, src_size, pattern, pattern_size,
  1079. start, raw == SQTrue, process_string_find_lua, v);
  1080. if(ms.error) return sq_throwerror(v, ms.error);
  1081. sq_pushinteger(v, rc);
  1082. return 1;
  1083. }
  1084. else if(rtype == OT_TABLE || rtype == OT_ARRAY){
  1085. LuaMatchState ms;
  1086. memset(&ms, 0, sizeof(ms));
  1087. int rc = str_find(&ms, src, src_size, pattern, pattern_size,
  1088. start, raw == SQTrue, 0, 0);
  1089. if(ms.error) return sq_throwerror(v, ms.error);
  1090. if(rtype == OT_TABLE){
  1091. sq_pushstring(v, _SC("start_pos"), -1);
  1092. sq_pushinteger(v, ms.start_pos);
  1093. sq_rawset(v, 3);
  1094. sq_pushstring(v, _SC("end_pos"), -1);
  1095. sq_pushinteger(v, ms.end_pos);
  1096. sq_rawset(v, 3);
  1097. }
  1098. else if(rtype == OT_ARRAY)
  1099. {
  1100. sq_pushinteger(v, 0);
  1101. sq_pushinteger(v, ms.start_pos);
  1102. sq_rawset(v, 3);
  1103. sq_pushinteger(v, 1);
  1104. sq_pushinteger(v, ms.end_pos);
  1105. sq_rawset(v, 3);
  1106. }
  1107. sq_pushinteger(v, rc);
  1108. return 1;
  1109. }
  1110. return sq_throwerror(v,"invalid type for parameter 3 function expected");
  1111. }
  1112. static const SQChar *lmemfind (const SQChar *s1, size_t l1,
  1113. const SQChar *s2, size_t l2) {
  1114. if (l2 == 0) return s1; /* empty strings are everywhere */
  1115. else if (l2 > l1) return NULL; /* avoids a negative `l1' */
  1116. else {
  1117. const SQChar *init; /* to search for a `*s2' inside `s1' */
  1118. l2--; /* 1st char will be checked by `memchr' */
  1119. l1 = l1-l2; /* `s2' cannot be found after that */
  1120. while (l1 > 0 && (init = (const SQChar *)memchr(s1, *s2, l1)) != NULL) {
  1121. init++; /* 1st char is already checked */
  1122. if (memcmp(init, s2+1, l2) == 0)
  1123. return init-1;
  1124. else { /* correct `l1' and `s1' to try again */
  1125. l1 -= init-s1;
  1126. s1 = init;
  1127. }
  1128. }
  1129. return NULL; /* not found */
  1130. }
  1131. }
  1132. /*DAD */
  1133. static SQRESULT string_replace(HSQUIRRELVM v) {
  1134. SQ_FUNC_VARS_NO_TOP(v);
  1135. SQ_GET_STRING(v, 1, src);
  1136. SQ_GET_STRING(v, 2, p);
  1137. SQ_GET_STRING(v, 3, p2);
  1138. const SQChar *s2;
  1139. int n = 0;
  1140. int init = 0;
  1141. SQBlob b(0, 8192);
  1142. while (1) {
  1143. s2 = lmemfind(src+init, src_size-init, p, p_size);
  1144. if (s2) {
  1145. b.Write(src+init, s2-(src+init));
  1146. b.Write(p2, p2_size);
  1147. init = init + (s2-(src+init)) + p_size;
  1148. n++;
  1149. } else {
  1150. b.Write(src+init, src_size-init);
  1151. break;
  1152. }
  1153. }
  1154. sq_pushstring(v, (const SQChar*)b.GetBuf(), b.Len());
  1155. return 1;
  1156. }
  1157. static SQRESULT string_endswith(HSQUIRRELVM v) {
  1158. SQ_FUNC_VARS_NO_TOP(v);
  1159. SQ_GET_STRING(v, 1, str);
  1160. SQ_GET_STRING(v, 2, token);
  1161. SQInteger ti = token_size, si = str_size;
  1162. SQBool end = SQTrue;
  1163. if(token_size <= str_size){
  1164. while(ti > 0) {
  1165. if(str[--si] != token[--ti]){
  1166. end = SQFalse;
  1167. break;
  1168. }
  1169. }
  1170. }
  1171. else {
  1172. end = SQFalse;
  1173. }
  1174. sq_pushbool(v, end);
  1175. return 1;
  1176. }
  1177. static SQRESULT string_startswith(HSQUIRRELVM v) {
  1178. SQ_FUNC_VARS_NO_TOP(v);
  1179. SQ_GET_STRING(v, 1, str);
  1180. SQ_GET_STRING(v, 2, token);
  1181. int i;
  1182. SQBool start = SQTrue;
  1183. // please make this less ugly...
  1184. if(token_size <= str_size){
  1185. for(i = 0; i < token_size; ++i) {
  1186. if(str[i] != token[i]){
  1187. start = SQFalse;
  1188. break;
  1189. }
  1190. }
  1191. }
  1192. else {
  1193. start = SQFalse;
  1194. }
  1195. sq_pushbool(v, start);
  1196. return 1;
  1197. }
  1198. static SQRESULT string_find_close_quote(HSQUIRRELVM v) {
  1199. SQ_FUNC_VARS(v);
  1200. SQ_GET_STRING(v, 1, src);
  1201. SQ_OPT_INTEGER(v, 2, init, 0);
  1202. if(init >= src_size) return sq_throwerror(v, _SC("invalid start position"));
  1203. for(; init < src_size; ++init) {
  1204. if(src[init] == '"'){
  1205. if(src[init+1] == '"') ++init; //skip quoted quote
  1206. else break;
  1207. }
  1208. }
  1209. if(src[init] != '"') init = -1;
  1210. sq_pushinteger(v, init);
  1211. return 1;
  1212. }
  1213. static SQRESULT string_getdelegate(HSQUIRRELVM v)
  1214. {
  1215. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  1216. }
  1217. //DAD end
  1218. #ifdef SQUNICODE
  1219. #define scstrchr wcschr
  1220. #define scsnprintf wsnprintf
  1221. #define scatoi _wtoi
  1222. #define scstrtok wcstok
  1223. #else
  1224. #define scstrchr strchr
  1225. #define scsnprintf snprintf
  1226. #define scatoi atoi
  1227. #define scstrtok strtok
  1228. #endif
  1229. static void __strip_l(const SQChar *str,const SQChar **start)
  1230. {
  1231. const SQChar *t = str;
  1232. while(((*t) != '\0') && scisspace(*t)){ t++; }
  1233. *start = t;
  1234. }
  1235. static void __strip_r(const SQChar *str,SQInteger len,const SQChar **end)
  1236. {
  1237. if(len == 0) {
  1238. *end = str;
  1239. return;
  1240. }
  1241. const SQChar *t = &str[len-1];
  1242. while(t >= str && scisspace(*t)) { t--; }
  1243. *end = t + 1;
  1244. }
  1245. static SQInteger string_strip(HSQUIRRELVM v)
  1246. {
  1247. const SQChar *str,*start,*end;
  1248. sq_getstring(v,1,&str);
  1249. SQInteger len = sq_getsize(v,1);
  1250. __strip_l(str,&start);
  1251. __strip_r(str,len,&end);
  1252. sq_pushstring(v,start,end - start);
  1253. return 1;
  1254. }
  1255. static SQInteger string_lstrip(HSQUIRRELVM v)
  1256. {
  1257. const SQChar *str,*start;
  1258. sq_getstring(v,1,&str);
  1259. __strip_l(str,&start);
  1260. sq_pushstring(v,start,-1);
  1261. return 1;
  1262. }
  1263. static SQInteger string_rstrip(HSQUIRRELVM v)
  1264. {
  1265. const SQChar *str,*end;
  1266. sq_getstring(v,1,&str);
  1267. SQInteger len = sq_getsize(v,1);
  1268. __strip_r(str,len,&end);
  1269. sq_pushstring(v,str,end - str);
  1270. return 1;
  1271. }
  1272. static SQInteger string_split(HSQUIRRELVM v)
  1273. {
  1274. const SQChar *str,*seps;
  1275. SQChar *stemp,*tok;
  1276. sq_getstring(v,1,&str);
  1277. sq_getstring(v,2,&seps);
  1278. if(sq_getsize(v,2) == 0) return sq_throwerror(v,_SC("empty separators string"));
  1279. SQInteger memsize = (sq_getsize(v,1)+1)*sizeof(SQChar);
  1280. stemp = sq_getscratchpad(v,memsize);
  1281. memcpy(stemp,str,memsize);
  1282. tok = scstrtok(stemp,seps);
  1283. sq_newarray(v,0);
  1284. while( tok != NULL ) {
  1285. sq_pushstring(v,tok,-1);
  1286. sq_arrayappend(v,-2);
  1287. tok = scstrtok( NULL, seps );
  1288. }
  1289. return 1;
  1290. }
  1291. static SQInteger string_empty(HSQUIRRELVM v)
  1292. {
  1293. sq_pushbool(v,sq_getsize(v,1) == 0);
  1294. return 1;
  1295. }
  1296. SQRegFunction SQSharedState::_string_default_delegate_funcz[]={
  1297. {_SC("len"),default_delegate_len,1, _SC("s")},
  1298. {_SC("size"),default_delegate_len,1, _SC("s")},
  1299. {_SC("tointeger"),default_delegate_tointeger,-1, _SC("sn")},
  1300. {_SC("tofloat"),default_delegate_tofloat,1, _SC("s")},
  1301. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1302. {_SC("slice"),string_slice,-1, _SC(" s n n")},
  1303. {_SC("substr"),string_substr,-2, _SC(" s n n")},
  1304. {_SC("replace"),string_replace,3, _SC("sss")},
  1305. {_SC("find"),string_find,-2, _SC("s s n ")},
  1306. {_SC("find_lua"),string_find_lua,-2, _SC("ss a|t|c nb")},
  1307. {_SC("find_close_quote"),string_find_close_quote,-1, _SC("sn")},
  1308. {_SC("gsub"),string_gsub,-3, _SC("s s s|a|t|c n")},
  1309. {_SC("gmatch"),string_gmatch, 3, _SC("s s c")},
  1310. {_SC("startswith"),string_startswith, 2, _SC("ss")},
  1311. {_SC("endswith"),string_endswith, 2, _SC("ss")},
  1312. {_SC("tolower"),string_tolower,1, _SC("s")},
  1313. {_SC("toupper"),string_toupper,1, _SC("s")},
  1314. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1315. {_SC("getdelegate"),string_getdelegate,1, _SC(".")},
  1316. {_SC("strip"),string_strip,1, _SC("s")},
  1317. {_SC("lstrip"),string_lstrip,1, _SC("s")},
  1318. {_SC("rstrip"),string_rstrip,1, _SC("s")},
  1319. {_SC("split"),string_split,2, _SC("ss")},
  1320. {_SC("empty"),string_empty,1, _SC("s")},
  1321. {0,0}
  1322. };
  1323. //INTEGER DEFAULT DELEGATE//////////////////////////
  1324. static SQInteger number_getdelegate(HSQUIRRELVM v)
  1325. {
  1326. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  1327. }
  1328. SQRegFunction SQSharedState::_number_default_delegate_funcz[]={
  1329. {_SC("tointeger"),default_delegate_tointeger,1, _SC("n|b")},
  1330. {_SC("tofloat"),default_delegate_tofloat,1, _SC("n|b")},
  1331. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1332. {_SC("tochar"),number_delegate_tochar,1, _SC("n|b")},
  1333. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1334. {_SC("getdelegate"),number_getdelegate,1, _SC(".")},
  1335. {0,0}
  1336. };
  1337. //CLOSURE DEFAULT DELEGATE//////////////////////////
  1338. static SQInteger closure_pcall(HSQUIRRELVM v)
  1339. {
  1340. return SQ_SUCCEEDED(sq_call(v,sq_gettop(v)-1,SQTrue,SQFalse))?1:SQ_ERROR;
  1341. }
  1342. static SQInteger closure_call(HSQUIRRELVM v)
  1343. {
  1344. return SQ_SUCCEEDED(sq_call(v,sq_gettop(v)-1,SQTrue,SQTrue))?1:SQ_ERROR;
  1345. }
  1346. static SQInteger _closure_acall(HSQUIRRELVM v,SQBool raiseerror, SQBool v2)
  1347. {
  1348. SQArray *aparams=_array(stack_get(v, v2 ? 3 : 2));
  1349. SQInteger nparams=aparams->Size();
  1350. v->Push(stack_get(v,1));
  1351. if(v2) v->Push(stack_get(v,2));
  1352. for(SQInteger i=0;i<nparams;i++)v->Push(aparams->_values[i]);
  1353. return SQ_SUCCEEDED(sq_call(v,nparams + (v2 ? 1 : 0),SQTrue,raiseerror))?1:SQ_ERROR;
  1354. }
  1355. static SQInteger closure_acall(HSQUIRRELVM v)
  1356. {
  1357. return _closure_acall(v,SQTrue, SQFalse);
  1358. }
  1359. static SQInteger closure_acall2(HSQUIRRELVM v)
  1360. {
  1361. return _closure_acall(v,SQTrue, SQTrue);
  1362. }
  1363. static SQInteger closure_pacall(HSQUIRRELVM v)
  1364. {
  1365. return _closure_acall(v,SQFalse, SQFalse);
  1366. }
  1367. static SQInteger closure_bindenv(HSQUIRRELVM v)
  1368. {
  1369. if(SQ_FAILED(sq_bindenv(v,1)))
  1370. return SQ_ERROR;
  1371. return 1;
  1372. }
  1373. static SQInteger closure_getinfos(HSQUIRRELVM v) {
  1374. SQObject o = stack_get(v,1);
  1375. SQTable *res = SQTable::Create(_ss(v),4);
  1376. if(type(o) == OT_CLOSURE) {
  1377. SQFunctionProto *f = _closure(o)->_function;
  1378. SQInteger nparams = f->_nparameters + (f->_varparams?1:0);
  1379. SQObjectPtr params = SQArray::Create(_ss(v),nparams);
  1380. SQObjectPtr defparams = SQArray::Create(_ss(v),f->_ndefaultparams);
  1381. for(SQInteger n = 0; n<f->_nparameters; n++) {
  1382. _array(params)->Set((SQInteger)n,f->_parameters[n]);
  1383. }
  1384. for(SQInteger j = 0; j<f->_ndefaultparams; j++) {
  1385. _array(defparams)->Set((SQInteger)j,_closure(o)->_defaultparams[j]);
  1386. }
  1387. if(f->_varparams) {
  1388. _array(params)->Set(nparams-1,SQString::Create(_ss(v),_SC("..."),-1));
  1389. }
  1390. res->NewSlot(SQString::Create(_ss(v),_SC("native"),-1),false);
  1391. res->NewSlot(SQString::Create(_ss(v),_SC("name"),-1),f->_name);
  1392. res->NewSlot(SQString::Create(_ss(v),_SC("src"),-1),f->_sourcename);
  1393. res->NewSlot(SQString::Create(_ss(v),_SC("parameters"),-1),params);
  1394. res->NewSlot(SQString::Create(_ss(v),_SC("varargs"),-1),f->_varparams);
  1395. res->NewSlot(SQString::Create(_ss(v),_SC("defparams"),-1),defparams);
  1396. }
  1397. else { //OT_NATIVECLOSURE
  1398. SQNativeClosure *nc = _nativeclosure(o);
  1399. res->NewSlot(SQString::Create(_ss(v),_SC("native"),-1),true);
  1400. res->NewSlot(SQString::Create(_ss(v),_SC("name"),-1),nc->_name);
  1401. res->NewSlot(SQString::Create(_ss(v),_SC("paramscheck"),-1),nc->_nparamscheck);
  1402. SQObjectPtr typecheck;
  1403. if(nc->_typecheck.size() > 0) {
  1404. typecheck =
  1405. SQArray::Create(_ss(v), nc->_typecheck.size());
  1406. for(SQUnsignedInteger n = 0; n<nc->_typecheck.size(); n++) {
  1407. _array(typecheck)->Set((SQInteger)n,nc->_typecheck[n]);
  1408. }
  1409. }
  1410. res->NewSlot(SQString::Create(_ss(v),_SC("typecheck"),-1),typecheck);
  1411. }
  1412. v->Push(res);
  1413. return 1;
  1414. }
  1415. SQRegFunction SQSharedState::_closure_default_delegate_funcz[]={
  1416. {_SC("call"),closure_call,-1, _SC("c")},
  1417. {_SC("pcall"),closure_pcall,-1, _SC("c")},
  1418. {_SC("acall"),closure_acall,2, _SC("ca")},
  1419. {_SC("acall2"),closure_acall2,3, _SC("c.a")},
  1420. {_SC("pacall"),closure_pacall,2, _SC("ca")},
  1421. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1422. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1423. {_SC("bindenv"),closure_bindenv,2, _SC("c x|y|t")},
  1424. {_SC("getinfos"),closure_getinfos,1, _SC("c")},
  1425. {0,0}
  1426. };
  1427. //GENERATOR DEFAULT DELEGATE
  1428. static SQInteger generator_getstatus(HSQUIRRELVM v)
  1429. {
  1430. SQObject &o=stack_get(v,1);
  1431. switch(_generator(o)->_state){
  1432. case SQGenerator::eSuspended:v->Push(SQString::Create(_ss(v),_SC("suspended")));break;
  1433. case SQGenerator::eRunning:v->Push(SQString::Create(_ss(v),_SC("running")));break;
  1434. case SQGenerator::eDead:v->Push(SQString::Create(_ss(v),_SC("dead")));break;
  1435. }
  1436. return 1;
  1437. }
  1438. SQRegFunction SQSharedState::_generator_default_delegate_funcz[]={
  1439. {_SC("getstatus"),generator_getstatus,1, _SC("g")},
  1440. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1441. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1442. {0,0}
  1443. };
  1444. //THREAD DEFAULT DELEGATE
  1445. static SQInteger thread_call(HSQUIRRELVM v)
  1446. {
  1447. SQObjectPtr o = stack_get(v,1);
  1448. if(type(o) == OT_THREAD) {
  1449. SQInteger nparams = sq_gettop(v);
  1450. _thread(o)->Push(_thread(o)->_roottable);
  1451. for(SQInteger i = 2; i<(nparams+1); i++)
  1452. sq_move(_thread(o),v,i);
  1453. if(SQ_SUCCEEDED(sq_call(_thread(o),nparams,SQTrue,SQTrue))) {
  1454. sq_move(v,_thread(o),-1);
  1455. sq_pop(_thread(o),1);
  1456. return 1;
  1457. }
  1458. v->_lasterror = _thread(o)->_lasterror;
  1459. return SQ_ERROR;
  1460. }
  1461. return sq_throwerror(v,_SC("wrong parameter"));
  1462. }
  1463. static SQInteger thread_wakeup(HSQUIRRELVM v)
  1464. {
  1465. SQObjectPtr o = stack_get(v,1);
  1466. if(type(o) == OT_THREAD) {
  1467. SQVM *thread = _thread(o);
  1468. SQInteger state = sq_getvmstate(thread);
  1469. if(state != SQ_VMSTATE_SUSPENDED) {
  1470. switch(state) {
  1471. case SQ_VMSTATE_IDLE:
  1472. return sq_throwerror(v,_SC("cannot wakeup a idle thread"));
  1473. break;
  1474. case SQ_VMSTATE_RUNNING:
  1475. return sq_throwerror(v,_SC("cannot wakeup a running thread"));
  1476. break;
  1477. }
  1478. }
  1479. SQInteger wakeupret = sq_gettop(v)>1?1:0;
  1480. if(wakeupret) {
  1481. sq_move(thread,v,2);
  1482. }
  1483. if(SQ_SUCCEEDED(sq_wakeupvm(thread,wakeupret,SQTrue,SQTrue,SQFalse))) {
  1484. sq_move(v,thread,-1);
  1485. sq_pop(thread,1); //pop retval
  1486. if(sq_getvmstate(thread) == SQ_VMSTATE_IDLE) {
  1487. sq_settop(thread,1); //pop roottable
  1488. }
  1489. return 1;
  1490. }
  1491. sq_settop(thread,1);
  1492. v->_lasterror = thread->_lasterror;
  1493. return SQ_ERROR;
  1494. }
  1495. return sq_throwerror(v,_SC("wrong parameter"));
  1496. }
  1497. static SQInteger thread_getstatus(HSQUIRRELVM v)
  1498. {
  1499. SQObjectPtr &o = stack_get(v,1);
  1500. switch(sq_getvmstate(_thread(o))) {
  1501. case SQ_VMSTATE_IDLE:
  1502. sq_pushstring(v,_SC("idle"),-1);
  1503. break;
  1504. case SQ_VMSTATE_RUNNING:
  1505. sq_pushstring(v,_SC("running"),-1);
  1506. break;
  1507. case SQ_VMSTATE_SUSPENDED:
  1508. sq_pushstring(v,_SC("suspended"),-1);
  1509. break;
  1510. default:
  1511. return sq_throwerror(v,_SC("internal VM error"));
  1512. }
  1513. return 1;
  1514. }
  1515. static SQInteger thread_getstackinfos(HSQUIRRELVM v)
  1516. {
  1517. SQObjectPtr o = stack_get(v,1);
  1518. if(type(o) == OT_THREAD) {
  1519. SQVM *thread = _thread(o);
  1520. SQInteger threadtop = sq_gettop(thread);
  1521. SQInteger level;
  1522. sq_getinteger(v,-1,&level);
  1523. SQRESULT res = __getcallstackinfos(thread,level);
  1524. if(SQ_FAILED(res))
  1525. {
  1526. sq_settop(thread,threadtop);
  1527. if(type(thread->_lasterror) == OT_STRING) {
  1528. sq_throwerror(v,_stringval(thread->_lasterror));
  1529. }
  1530. else {
  1531. sq_throwerror(v,_SC("unknown error"));
  1532. }
  1533. }
  1534. if(res > 0) {
  1535. //some result
  1536. sq_move(v,thread,-1);
  1537. sq_settop(thread,threadtop);
  1538. return 1;
  1539. }
  1540. //no result
  1541. sq_settop(thread,threadtop);
  1542. return 0;
  1543. }
  1544. return sq_throwerror(v,_SC("wrong parameter"));
  1545. }
  1546. SQRegFunction SQSharedState::_thread_default_delegate_funcz[] = {
  1547. {_SC("call"), thread_call, -1, _SC("v")},
  1548. {_SC("wakeup"), thread_wakeup, -1, _SC("v")},
  1549. {_SC("getstatus"), thread_getstatus, 1, _SC("v")},
  1550. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1551. {_SC("getstackinfos"),thread_getstackinfos,2, _SC("vn")},
  1552. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1553. {0,0},
  1554. };
  1555. static SQInteger class_getattributes(HSQUIRRELVM v)
  1556. {
  1557. return SQ_SUCCEEDED(sq_getattributes(v,-2))?1:SQ_ERROR;
  1558. }
  1559. static SQInteger class_setattributes(HSQUIRRELVM v)
  1560. {
  1561. return SQ_SUCCEEDED(sq_setattributes(v,-3))?1:SQ_ERROR;
  1562. }
  1563. static SQInteger class_instance(HSQUIRRELVM v)
  1564. {
  1565. return SQ_SUCCEEDED(sq_createinstance(v,-1))?1:SQ_ERROR;
  1566. }
  1567. static SQInteger class_getbase(HSQUIRRELVM v)
  1568. {
  1569. return SQ_SUCCEEDED(sq_getbase(v,-1))?1:SQ_ERROR;
  1570. }
  1571. static SQInteger class_newmember(HSQUIRRELVM v)
  1572. {
  1573. SQInteger top = sq_gettop(v);
  1574. SQBool bstatic = SQFalse;
  1575. if(top == 5)
  1576. {
  1577. sq_tobool(v,-1,&bstatic);
  1578. sq_pop(v,1);
  1579. }
  1580. if(top < 4) {
  1581. sq_pushnull(v);
  1582. }
  1583. return SQ_SUCCEEDED(sq_newmember(v,-4,bstatic))?1:SQ_ERROR;
  1584. }
  1585. static SQInteger class_rawnewmember(HSQUIRRELVM v)
  1586. {
  1587. SQInteger top = sq_gettop(v);
  1588. SQBool bstatic = SQFalse;
  1589. if(top == 5)
  1590. {
  1591. sq_tobool(v,-1,&bstatic);
  1592. sq_pop(v,1);
  1593. }
  1594. if(top < 4) {
  1595. sq_pushnull(v);
  1596. }
  1597. return SQ_SUCCEEDED(sq_rawnewmember(v,-4,bstatic))?1:SQ_ERROR;
  1598. }
  1599. static SQInteger class_getdelegate(HSQUIRRELVM v)
  1600. {
  1601. return SQ_SUCCEEDED(sq_getdelegate(v,-1))?1:SQ_ERROR;
  1602. }
  1603. SQRegFunction SQSharedState::_class_default_delegate_funcz[] = {
  1604. {_SC("getattributes"), class_getattributes, 2, _SC("y.")},
  1605. {_SC("setattributes"), class_setattributes, 3, _SC("y..")},
  1606. {_SC("get"),container_get,-2, _SC("y")},
  1607. {_SC("rawget"),container_rawget,-2, _SC("y")},
  1608. {_SC("rawset"),container_rawset,3, _SC("y")},
  1609. {_SC("rawin"),container_rawexists,2, _SC("y")},
  1610. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1611. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1612. {_SC("instance"),class_instance,1, _SC("y")},
  1613. {_SC("getbase"),class_getbase,1, _SC("y")},
  1614. {_SC("newmember"),class_newmember,-3, _SC("y")},
  1615. {_SC("rawnewmember"),class_rawnewmember,-3, _SC("y")},
  1616. {_SC("getdelegate"),class_getdelegate,1, _SC(".")},
  1617. {0,0}
  1618. };
  1619. static SQInteger instance_getclass(HSQUIRRELVM v)
  1620. {
  1621. if(SQ_SUCCEEDED(sq_getclass(v,1)))
  1622. return 1;
  1623. return SQ_ERROR;
  1624. }
  1625. SQRegFunction SQSharedState::_instance_default_delegate_funcz[] = {
  1626. {_SC("getclass"), instance_getclass, 1, _SC("x")},
  1627. {_SC("get"),container_get,-2, _SC("x")},
  1628. {_SC("rawget"),container_rawget,-2, _SC("x")},
  1629. {_SC("rawset"),container_rawset,3, _SC("x")},
  1630. {_SC("rawin"),container_rawexists,2, _SC("x")},
  1631. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1632. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1633. {0,0}
  1634. };
  1635. static SQInteger weakref_ref(HSQUIRRELVM v)
  1636. {
  1637. if(SQ_FAILED(sq_getweakrefval(v,1)))
  1638. return SQ_ERROR;
  1639. return 1;
  1640. }
  1641. SQRegFunction SQSharedState::_weakref_default_delegate_funcz[] = {
  1642. {_SC("ref"),weakref_ref,1, _SC("r")},
  1643. {_SC("weakref"),obj_delegate_weakref,1, NULL },
  1644. {_SC("tostring"),default_delegate_tostring,1, _SC(".")},
  1645. {0,0}
  1646. };