sqbaselib.cpp 74 KB

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