sqbaselib.cpp 87 KB

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