sqbaselib.cpp 71 KB

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