sqbaselib.cpp 59 KB

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