sqstdstring.cpp 21 KB

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