sqbaselib.cpp 55 KB

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