sqbaselib.cpp 86 KB

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