sqbaselib.cpp 78 KB

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