sqbaselib.cpp 57 KB

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