sqbaselib.cpp 76 KB

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