sqbaselib.cpp 53 KB

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