sqbaselib.cpp 65 KB

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