sqbaselib.cpp 54 KB

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