sqstdstring.cpp 17 KB

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