sqbaselib.cpp 88 KB

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