sqstdstring.cpp 22 KB

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