sqbaselib.cpp 56 KB

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