sqbaselib.cpp 80 KB

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