sqstdstring.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608
  1. /* see copyright notice in squirrel.h */
  2. #include <squirrel.h>
  3. #include <sqstdstring.h>
  4. #include <string.h>
  5. #include <stdlib.h>
  6. #include <stdio.h>
  7. #include <stdlib.h>
  8. #include <ctype.h>
  9. #include <assert.h>
  10. #include <stddef.h>
  11. #ifdef _WIN32_WCE
  12. extern "C" {
  13. int _wtoi (const wchar_t *);
  14. }
  15. #endif // _WINCE
  16. #define MAX_FORMAT_LEN 20
  17. #define MAX_WFORMAT_LEN 3
  18. #define ADDITIONAL_FORMAT_SPACE (100*sizeof(SQChar))
  19. static SQBool isfmtchr(SQChar ch)
  20. {
  21. switch(ch) {
  22. case '-': case '+': case ' ': case '#': case '0': return SQTrue;
  23. }
  24. return SQFalse;
  25. }
  26. static SQRESULT validate_format(HSQUIRRELVM v, SQChar *fmt, const SQChar *src, SQInteger n,SQInteger &width)
  27. {
  28. SQChar *dummy;
  29. SQChar swidth[MAX_WFORMAT_LEN];
  30. SQInteger wc = 0;
  31. SQInteger start = n;
  32. fmt[0] = _SC('%');
  33. while (isfmtchr(src[n])) n++;
  34. while (scisdigit(src[n])) {
  35. swidth[wc] = src[n];
  36. n++;
  37. wc++;
  38. if(wc>=MAX_WFORMAT_LEN)
  39. return sq_throwerror(v,_SC("width format too long"));
  40. }
  41. swidth[wc] = _SC('\0');
  42. if(wc > 0) {
  43. width = scstrtol(swidth,&dummy,10);
  44. }
  45. else
  46. width = 0;
  47. if (src[n] == _SC('.')) {
  48. n++;
  49. wc = 0;
  50. while (scisdigit(src[n])) {
  51. swidth[wc] = src[n];
  52. n++;
  53. wc++;
  54. if(wc>=MAX_WFORMAT_LEN)
  55. return sq_throwerror(v,_SC("precision format too long"));
  56. }
  57. swidth[wc] = _SC('\0');
  58. if(wc > 0) {
  59. width += scstrtol(swidth,&dummy,10);
  60. }
  61. }
  62. if (n-start > MAX_FORMAT_LEN )
  63. return sq_throwerror(v,_SC("format too long"));
  64. memcpy(&fmt[1],&src[start],((n-start)+1)*sizeof(SQChar));
  65. fmt[(n-start)+2] = _SC('\0');
  66. return n;
  67. }
  68. SQRESULT sqstd_format(HSQUIRRELVM v,SQInteger nformatstringidx,SQInteger *outlen,SQChar **output)
  69. {
  70. const SQChar *format;
  71. SQChar *dest;
  72. SQChar fmt[MAX_FORMAT_LEN];
  73. sq_getstring(v,nformatstringidx,&format);
  74. SQInteger format_size = sq_getsize(v,nformatstringidx);
  75. SQInteger allocated = (format_size+2)*sizeof(SQChar);
  76. dest = sq_getscratchpad(v,allocated);
  77. SQInteger n = 0,i = 0, nparam = nformatstringidx+1, w = 0;
  78. while(n < format_size) {
  79. if(format[n] != _SC('%')) {
  80. assert(i < allocated);
  81. dest[i++] = format[n];
  82. n++;
  83. }
  84. else if(format[n+1] == _SC('%')) { //handles %%
  85. dest[i++] = _SC('%');
  86. n += 2;
  87. }
  88. else {
  89. n++;
  90. if( nparam > sq_gettop(v) )
  91. return sq_throwerror(v,_SC("not enough paramters for the given format string"));
  92. n = validate_format(v,fmt,format,n,w);
  93. if(n < 0) return -1;
  94. SQInteger addlen = 0;
  95. SQInteger valtype = 0;
  96. const SQChar *ts = NULL;
  97. SQInteger ti = 0;
  98. SQFloat tf = 0.0;
  99. SQInteger fc = format[n];
  100. switch(fc) {
  101. case _SC('q'):
  102. case _SC('s'):
  103. if(SQ_FAILED(sq_getstring(v,nparam,&ts)))
  104. return sq_throwerror(v,_SC("string expected for the specified format"));
  105. if(fc == _SC('q')){
  106. addlen = 2; //quotes before and after
  107. SQInteger size = sq_getsize(v,nparam);
  108. SQChar *ts2 = (SQChar*)ts;
  109. while (size--) {
  110. ++addlen;
  111. if (*ts2 == _SC('\r') && *(ts2+1) == _SC('\n') ) {
  112. ++addlen;
  113. ++ts2; --size;//eat \r and output only \n
  114. }
  115. else if (*ts2 == _SC('"') || *ts2 == _SC('\\') || *ts2 == _SC('\n') || *ts2 == _SC('\t')) {
  116. ++addlen;
  117. }
  118. else if (*ts2 == _SC('\0') || sciscntrl(SQUChar(*ts2))) {
  119. SQChar buff[10];
  120. addlen += scsprintf(buff, sizeof(buff), _SC("\\x%x"), (int)SQUChar(*ts2))-1; //-1 because we already added the original char to the sum
  121. }
  122. ++ts2;
  123. }
  124. ts2 = (SQChar*)i; //save the i position using pointer as integer
  125. i += addlen;
  126. allocated += addlen;
  127. dest = sq_getscratchpad(v,allocated);
  128. size = sq_getsize(v,nparam);
  129. ts2 = &dest[(ptrdiff_t)ts2]; //use saved i position saved on pointer as integer
  130. *ts2++ = _SC('"');
  131. while (size--) {
  132. if (*ts == _SC('\r') && *(ts+1) == _SC('\n') ) {
  133. ++ts; --size;//eat \r and output only \n
  134. }
  135. if (*ts == _SC('"') || *ts == _SC('\\')) {
  136. *ts2++ = _SC('\\');
  137. *ts2++ = *ts;
  138. }
  139. else if (*ts == _SC('\n')) {
  140. *ts2++ = _SC('\\');
  141. *ts2++ = _SC('n');
  142. }
  143. else if (*ts == _SC('\t')) {
  144. *ts2++ = _SC('\\');
  145. *ts2++ = _SC('t');
  146. }
  147. else if (*ts == _SC('\0') || sciscntrl(SQUChar(*ts))) {
  148. SQChar buff[10];
  149. int iw;
  150. iw = scsprintf(buff, sizeof(buff), _SC("\\x%x"), (int)SQUChar(*ts));
  151. for(int i=0; i< iw; ++i) *ts2++ = buff[i];
  152. }
  153. else
  154. *ts2++ = *ts;
  155. ++ts;
  156. }
  157. *ts2++ = _SC('"');
  158. ++n;
  159. ++nparam;
  160. continue;
  161. }
  162. else
  163. {
  164. addlen = (sq_getsize(v,nparam)*sizeof(SQChar))+((w+1)*sizeof(SQChar));
  165. valtype = _SC('s');
  166. }
  167. break;
  168. case _SC('i'): case _SC('d'): case _SC('o'): case _SC('u'): case _SC('x'): case _SC('X'):
  169. #ifdef _SQ64
  170. {
  171. size_t flen = scstrlen(fmt);
  172. SQInteger fpos = flen - 1;
  173. SQChar f = fmt[fpos];
  174. SQChar *prec = (SQChar *)_PRINT_INT_PREC;
  175. while(*prec != _SC('\0')) {
  176. fmt[fpos++] = *prec++;
  177. }
  178. fmt[fpos++] = f;
  179. fmt[fpos++] = _SC('\0');
  180. }
  181. #endif
  182. case _SC('c'):
  183. if(SQ_FAILED(sq_getinteger(v,nparam,&ti)))
  184. return sq_throwerror(v,_SC("integer expected for the specified format"));
  185. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  186. valtype = _SC('i');
  187. break;
  188. case _SC('f'): case _SC('g'): case _SC('G'): case _SC('e'): case _SC('E'):
  189. if(SQ_FAILED(sq_getfloat(v,nparam,&tf)))
  190. return sq_throwerror(v,_SC("float expected for the specified format"));
  191. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  192. valtype = _SC('f');
  193. break;
  194. default:
  195. return sq_throwerror(v,_SC("invalid format"));
  196. }
  197. n++;
  198. allocated += addlen + sizeof(SQChar);
  199. dest = sq_getscratchpad(v,allocated);
  200. switch(valtype) {
  201. case 's': i += scsprintf(&dest[i],allocated,fmt,ts); break;
  202. case 'i': i += scsprintf(&dest[i],allocated,fmt,ti); break;
  203. case 'f': i += scsprintf(&dest[i],allocated,fmt,tf); break;
  204. };
  205. nparam ++;
  206. }
  207. }
  208. *outlen = i;
  209. dest[i] = _SC('\0');
  210. *output = dest;
  211. return SQ_OK;
  212. }
  213. static SQRESULT _string_format(HSQUIRRELVM v)
  214. {
  215. SQChar *dest = NULL;
  216. SQInteger length = 0;
  217. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  218. return -1;
  219. sq_pushstring(v,dest,length);
  220. return 1;
  221. }
  222. static SQRESULT _string_printf(HSQUIRRELVM v)
  223. {
  224. SQChar *dest = NULL;
  225. SQInteger length = 0;
  226. SQPRINTFUNCTION sqprint = sq_getprintfunc(v);
  227. if(sqprint){
  228. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  229. return -1;
  230. sqprint(v,_SC("%s"),dest);
  231. sq_pushinteger(v, length);
  232. return 1;
  233. }
  234. return 0;
  235. }
  236. static SQInteger _string_escape(HSQUIRRELVM v)
  237. {
  238. const SQChar *str;
  239. SQChar *dest,*resstr;
  240. SQInteger size;
  241. sq_getstring(v,2,&str);
  242. size = sq_getsize(v,2);
  243. if(size == 0) {
  244. sq_push(v,2);
  245. return 1;
  246. }
  247. #ifdef SQUNICODE
  248. #if WCHAR_SIZE == 2
  249. const SQChar *escpat = _SC("\\x%04x");
  250. const SQInteger maxescsize = 6;
  251. #else //WCHAR_SIZE == 4
  252. const SQChar *escpat = _SC("\\x%08x");
  253. const SQInteger maxescsize = 10;
  254. #endif
  255. #else
  256. const SQChar *escpat = _SC("\\x%02x");
  257. const SQInteger maxescsize = 4;
  258. #endif
  259. SQInteger destcharsize = (size * maxescsize); //assumes every char could be escaped
  260. resstr = dest = (SQChar *)sq_getscratchpad(v,destcharsize * sizeof(SQChar));
  261. SQChar c;
  262. SQChar escch;
  263. SQInteger escaped = 0;
  264. for(int n = 0; n < size; n++){
  265. c = *str++;
  266. escch = 0;
  267. if(scisprint(c) || c == 0) {
  268. switch(c) {
  269. case '\a': escch = 'a'; break;
  270. case '\b': escch = 'b'; break;
  271. case '\t': escch = 't'; break;
  272. case '\n': escch = 'n'; break;
  273. case '\v': escch = 'v'; break;
  274. case '\f': escch = 'f'; break;
  275. case '\r': escch = 'r'; break;
  276. case '\\': escch = '\\'; break;
  277. case '\"': escch = '\"'; break;
  278. case '\'': escch = '\''; break;
  279. case 0: escch = '0'; break;
  280. }
  281. if(escch) {
  282. *dest++ = '\\';
  283. *dest++ = escch;
  284. escaped++;
  285. }
  286. else {
  287. *dest++ = c;
  288. }
  289. }
  290. else {
  291. dest += scsprintf(dest, destcharsize, escpat, c);
  292. escaped++;
  293. }
  294. }
  295. if(escaped) {
  296. sq_pushstring(v,resstr,dest - resstr);
  297. }
  298. else {
  299. sq_push(v,2); //nothing escaped
  300. }
  301. return 1;
  302. }
  303. #define SETUP_REX(v) \
  304. SQRex *self = NULL; \
  305. sq_getinstanceup(v,1,(SQUserPointer *)&self,0);
  306. static SQRESULT _rexobj_releasehook(SQUserPointer p, SQInteger /*size*/, HSQUIRRELVM /*v*/)
  307. {
  308. SQRex *self = ((SQRex *)p);
  309. sqstd_rex_free(self);
  310. return 1;
  311. }
  312. static SQRESULT _regexp_match(HSQUIRRELVM v)
  313. {
  314. SETUP_REX(v);
  315. const SQChar *str;
  316. sq_getstring(v,2,&str);
  317. if(sqstd_rex_match(self,str) == SQTrue)
  318. {
  319. sq_pushbool(v,SQTrue);
  320. return 1;
  321. }
  322. sq_pushbool(v,SQFalse);
  323. return 1;
  324. }
  325. static SQRESULT _regexp_gmatch(HSQUIRRELVM v)
  326. {
  327. SETUP_REX(v);
  328. const SQChar *str;
  329. SQInteger str_size;
  330. sq_getstring(v,2,&str);
  331. str_size = sq_getsize(v, 2);
  332. const SQChar *begin,*end;
  333. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  334. SQInteger n = sqstd_rex_getsubexpcount(self);
  335. SQRexMatch match;
  336. sq_pushroottable(v); //this
  337. SQInteger i = 0;
  338. for(;i < n; i++) {
  339. sqstd_rex_getsubexp(self,i,&match);
  340. if(i > 0){ //skip whole match
  341. sq_pushstring(v, match.begin, match.len);
  342. }
  343. }
  344. i = sq_call(v, n, SQFalse, SQTrue);
  345. if(i < 0) return i;
  346. str_size -= end-str;
  347. str = end;
  348. }
  349. sq_pushbool(v,SQFalse);
  350. return 1;
  351. }
  352. #include "sqstdblobimpl.h"
  353. static SQRESULT _regexp_gsub(HSQUIRRELVM v)
  354. {
  355. SETUP_REX(v);
  356. const SQChar *str;
  357. SQInteger str_size;
  358. sq_getstring(v,2,&str);
  359. str_size = sq_getsize(v, 2);
  360. const SQChar *begin,*end;
  361. SQBlob blob(0,8192);
  362. SQObjectType ptype = sq_gettype(v, 3);
  363. const SQChar *replacement;
  364. SQInteger replacement_size;
  365. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  366. blob.Write(str, begin-str);
  367. SQInteger n = sqstd_rex_getsubexpcount(self);
  368. SQRexMatch match;
  369. SQInteger i = 0;
  370. switch(ptype){
  371. case OT_CLOSURE:{
  372. sq_pushroottable(v); //this
  373. for(;i < n; i++) {
  374. sqstd_rex_getsubexp(self,i,&match);
  375. if(i > 0){ //skip whole match
  376. sq_pushstring(v, match.begin, match.len);
  377. }
  378. }
  379. i = sq_call(v, n, SQTrue, SQTrue);
  380. if(i < 0) return i;
  381. if(sq_gettype(v, -1) == OT_STRING){
  382. const SQChar *svalue;
  383. sq_getstring(v, -1, &svalue);
  384. blob.Write(svalue, sq_getsize(v, -1));
  385. }
  386. sq_poptop(v);
  387. }
  388. break;
  389. case OT_ARRAY:{
  390. for(;i < n; i++) {
  391. sqstd_rex_getsubexp(self,i,&match);
  392. if(i > 0){ //skip whole match
  393. sq_pushinteger(v, i-1);
  394. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  395. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  396. blob.Write(replacement, replacement_size);
  397. sq_pop(v, 1); //remove value
  398. }
  399. }
  400. }
  401. }
  402. break;
  403. case OT_TABLE:{
  404. for(;i < n; i++) {
  405. sqstd_rex_getsubexp(self,i,&match);
  406. if(i > 0){ //skip whole match
  407. sq_pushstring(v, match.begin, match.len);
  408. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  409. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  410. blob.Write(replacement, replacement_size);
  411. sq_pop(v, 1); //remove value
  412. }
  413. }
  414. }
  415. }
  416. break;
  417. default:
  418. return sq_throwerror(v, _SC("gsub only works with closure, array, table for replacement"));
  419. }
  420. str_size -= end-str;
  421. str = end;
  422. }
  423. if(str_size) blob.Write(str, str_size);
  424. sq_pushstring(v, (const SQChar *)blob.GetBuf(), blob.Len());
  425. return 1;
  426. }
  427. static void _addrexmatch(HSQUIRRELVM v,const SQChar *str,const SQChar *begin,const SQChar *end)
  428. {
  429. sq_newtable(v);
  430. sq_pushstring(v,_SC("begin"),-1);
  431. sq_pushinteger(v,begin - str);
  432. sq_rawset(v,-3);
  433. sq_pushstring(v,_SC("end"),-1);
  434. sq_pushinteger(v,end - str);
  435. sq_rawset(v,-3);
  436. }
  437. static SQRESULT _regexp_search(HSQUIRRELVM v)
  438. {
  439. SETUP_REX(v);
  440. const SQChar *str,*begin,*end;
  441. SQInteger start = 0;
  442. sq_getstring(v,2,&str);
  443. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  444. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  445. _addrexmatch(v,str,begin,end);
  446. return 1;
  447. }
  448. return 0;
  449. }
  450. static SQRESULT _regexp_capture(HSQUIRRELVM v)
  451. {
  452. SETUP_REX(v);
  453. const SQChar *str,*begin,*end;
  454. SQInteger start = 0;
  455. sq_getstring(v,2,&str);
  456. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  457. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  458. SQInteger n = sqstd_rex_getsubexpcount(self);
  459. SQRexMatch match;
  460. sq_newarray(v,0);
  461. for(SQInteger i = 0;i < n; i++) {
  462. sqstd_rex_getsubexp(self,i,&match);
  463. if(match.len > 0)
  464. _addrexmatch(v,str,match.begin,match.begin+match.len);
  465. else
  466. _addrexmatch(v,str,str,str); //empty match
  467. sq_arrayappend(v,-2);
  468. }
  469. return 1;
  470. }
  471. return 0;
  472. }
  473. static SQRESULT _regexp_xcapture(HSQUIRRELVM v)
  474. {
  475. SETUP_REX(v);
  476. const SQChar *str,*begin,*end;
  477. SQInteger start = 0;
  478. sq_getstring(v,2,&str);
  479. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  480. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  481. sq_pushbool(v, SQTrue);
  482. return 1;
  483. }
  484. return 0;
  485. }
  486. static SQRESULT _regexp_getxcapture(HSQUIRRELVM v)
  487. {
  488. SETUP_REX(v);
  489. SQInteger n, start;
  490. const SQChar *str;
  491. sq_getstring(v,2,&str);
  492. sq_getinteger(v,3,&n);
  493. SQRexMatch match;
  494. sqstd_rex_getsubexp(self,n,&match);
  495. if(match.len > 0){
  496. start = match.begin-str;
  497. sq_pushinteger(v, start);
  498. sq_arrayappend(v,-2);
  499. sq_pushinteger(v, start+match.len);
  500. sq_arrayappend(v,-2);
  501. sq_pushbool(v, SQTrue);
  502. return 1;
  503. }
  504. return 0;
  505. }
  506. static SQRESULT _regexp_subexpcount(HSQUIRRELVM v)
  507. {
  508. SETUP_REX(v);
  509. sq_pushinteger(v,sqstd_rex_getsubexpcount(self));
  510. return 1;
  511. }
  512. static SQRESULT _regexp_constructor(HSQUIRRELVM v)
  513. {
  514. const SQChar *error,*pattern;
  515. sq_getstring(v,2,&pattern);
  516. SQRex *rex = sqstd_rex_compile(pattern,&error);
  517. if(!rex) return sq_throwerror(v,error);
  518. sq_setinstanceup(v,1,rex);
  519. sq_setreleasehook(v,1,_rexobj_releasehook);
  520. return 0;
  521. }
  522. static SQRESULT _regexp__typeof(HSQUIRRELVM v)
  523. {
  524. sq_pushstring(v,_SC("regexp"),-1);
  525. return 1;
  526. }
  527. #define _DECL_REX_FUNC(name,nparams,pmask) {_SC(#name),_regexp_##name,nparams,pmask}
  528. static SQRegFunction rexobj_funcs[]={
  529. _DECL_REX_FUNC(constructor,2,_SC(".s")),
  530. _DECL_REX_FUNC(search,-2,_SC("xsn")),
  531. _DECL_REX_FUNC(match,2,_SC("xs")),
  532. _DECL_REX_FUNC(gmatch,3,_SC("xsc")),
  533. _DECL_REX_FUNC(gsub,3,_SC("xs c|a|t")),
  534. _DECL_REX_FUNC(capture,-2,_SC("xsn")),
  535. _DECL_REX_FUNC(xcapture,-2,_SC("xsn")),
  536. _DECL_REX_FUNC(getxcapture,4,_SC("xsna")),
  537. _DECL_REX_FUNC(subexpcount,1,_SC("x")),
  538. _DECL_REX_FUNC(_typeof,1,_SC("x")),
  539. {NULL,(SQFUNCTION)0,0,NULL}
  540. };
  541. #undef _DECL_REX_FUNC
  542. #define _DECL_FUNC(name,nparams,pmask) {_SC(#name),_string_##name,nparams,pmask}
  543. static SQRegFunction stringlib_funcs[]={
  544. _DECL_FUNC(printf,-2,_SC(".s")),
  545. _DECL_FUNC(format,-2,_SC(".s")),
  546. _DECL_FUNC(escape,2,_SC(".s")),
  547. {NULL,(SQFUNCTION)0,0,NULL}
  548. };
  549. #undef _DECL_FUNC
  550. SQInteger sqstd_register_stringlib(HSQUIRRELVM v)
  551. {
  552. sq_pushstring(v,_SC("regexp"),-1);
  553. sq_newclass(v,SQFalse);
  554. SQInteger i = 0;
  555. while(rexobj_funcs[i].name != 0) {
  556. SQRegFunction &f = rexobj_funcs[i];
  557. sq_pushstring(v,f.name,-1);
  558. sq_newclosure(v,f.f,0);
  559. sq_setparamscheck(v,f.nparamscheck,f.typemask);
  560. sq_setnativeclosurename(v,-1,f.name);
  561. sq_newslot(v,-3,SQFalse);
  562. i++;
  563. }
  564. sq_newslot(v,-3,SQFalse);
  565. i = 0;
  566. while(stringlib_funcs[i].name!=0)
  567. {
  568. sq_pushstring(v,stringlib_funcs[i].name,-1);
  569. sq_newclosure(v,stringlib_funcs[i].f,0);
  570. sq_setparamscheck(v,stringlib_funcs[i].nparamscheck,stringlib_funcs[i].typemask);
  571. sq_setnativeclosurename(v,-1,stringlib_funcs[i].name);
  572. sq_newslot(v,-3,SQFalse);
  573. i++;
  574. }
  575. return 1;
  576. }