sqbaselib.cpp 72 KB

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