sqbaselib.cpp 52 KB

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