sqbaselib.cpp 61 KB

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