sqbaselib.cpp 74 KB

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