sqbaselib.cpp 55 KB

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