sqstdstring.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538
  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;
  97. SQInteger ti;
  98. SQFloat tf;
  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') || iscntrl(uchar(*ts2))) {
  119. SQChar buff[10];
  120. addlen += scsprintf(buff, _SC("\\x%x"), (int)uchar(*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') || iscntrl(uchar(*ts))) {
  148. SQChar buff[10];
  149. int iw;
  150. iw = scsprintf(buff, _SC("\\x%x"), (int)uchar(*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 _SC('s'): i += scsprintf(&dest[i],fmt,ts); break;
  202. case _SC('i'): i += scsprintf(&dest[i],fmt,ti); break;
  203. case _SC('f'): i += scsprintf(&dest[i],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. #define SETUP_REX(v) \
  237. SQRex *self = NULL; \
  238. sq_getinstanceup(v,1,(SQUserPointer *)&self,0);
  239. static SQRESULT _rexobj_releasehook(SQUserPointer p, SQInteger size, HSQUIRRELVM v)
  240. {
  241. SQRex *self = ((SQRex *)p);
  242. sqstd_rex_free(self);
  243. return 1;
  244. }
  245. static SQRESULT _regexp_match(HSQUIRRELVM v)
  246. {
  247. SETUP_REX(v);
  248. const SQChar *str;
  249. sq_getstring(v,2,&str);
  250. if(sqstd_rex_match(self,str) == SQTrue)
  251. {
  252. sq_pushbool(v,SQTrue);
  253. return 1;
  254. }
  255. sq_pushbool(v,SQFalse);
  256. return 1;
  257. }
  258. static SQRESULT _regexp_gmatch(HSQUIRRELVM v)
  259. {
  260. SETUP_REX(v);
  261. const SQChar *str;
  262. SQInteger str_size;
  263. sq_getstring(v,2,&str);
  264. str_size = sq_getsize(v, 2);
  265. const SQChar *begin,*end;
  266. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  267. SQInteger n = sqstd_rex_getsubexpcount(self);
  268. SQRexMatch match;
  269. sq_pushroottable(v); //this
  270. SQInteger i = 0;
  271. for(;i < n; i++) {
  272. sqstd_rex_getsubexp(self,i,&match);
  273. if(i > 0){ //skip whole match
  274. sq_pushstring(v, match.begin, match.len);
  275. }
  276. }
  277. i = sq_call(v, n, SQFalse, SQTrue);
  278. if(i < 0) return i;
  279. str_size -= end-str;
  280. str = end;
  281. }
  282. sq_pushbool(v,SQFalse);
  283. return 1;
  284. }
  285. #include "sqstdblobimpl.h"
  286. static SQRESULT _regexp_gsub(HSQUIRRELVM v)
  287. {
  288. SETUP_REX(v);
  289. const SQChar *str;
  290. SQInteger str_size;
  291. sq_getstring(v,2,&str);
  292. str_size = sq_getsize(v, 2);
  293. const SQChar *begin,*end;
  294. SQBlob blob(0,8192);
  295. SQObjectType ptype = sq_gettype(v, 3);
  296. const SQChar *replacement;
  297. SQInteger replacement_size;
  298. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  299. blob.Write(str, begin-str);
  300. SQInteger n = sqstd_rex_getsubexpcount(self);
  301. SQRexMatch match;
  302. SQInteger i = 0;
  303. switch(ptype){
  304. case OT_CLOSURE:{
  305. sq_pushroottable(v); //this
  306. for(;i < n; i++) {
  307. sqstd_rex_getsubexp(self,i,&match);
  308. if(i > 0){ //skip whole match
  309. sq_pushstring(v, match.begin, match.len);
  310. }
  311. }
  312. i = sq_call(v, n, SQTrue, SQTrue);
  313. if(i < 0) return i;
  314. if(sq_gettype(v, -1) == OT_STRING){
  315. const SQChar *svalue;
  316. sq_getstring(v, -1, &svalue);
  317. blob.Write(svalue, sq_getsize(v, -1));
  318. }
  319. sq_poptop(v);
  320. }
  321. break;
  322. case OT_ARRAY:{
  323. for(;i < n; i++) {
  324. sqstd_rex_getsubexp(self,i,&match);
  325. if(i > 0){ //skip whole match
  326. sq_pushinteger(v, i-1);
  327. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  328. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  329. blob.Write(replacement, replacement_size);
  330. sq_pop(v, 1); //remove value
  331. }
  332. }
  333. }
  334. }
  335. break;
  336. case OT_TABLE:{
  337. for(;i < n; i++) {
  338. sqstd_rex_getsubexp(self,i,&match);
  339. if(i > 0){ //skip whole match
  340. sq_pushstring(v, match.begin, match.len);
  341. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  342. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  343. blob.Write(replacement, replacement_size);
  344. sq_pop(v, 1); //remove value
  345. }
  346. }
  347. }
  348. }
  349. break;
  350. default:
  351. return sq_throwerror(v, _SC("gsub only works with closure, array, table for replacement"));
  352. }
  353. str_size -= end-str;
  354. str = end;
  355. }
  356. if(str_size) blob.Write(str, str_size);
  357. sq_pushstring(v, (const SQChar *)blob.GetBuf(), blob.Len());
  358. return 1;
  359. }
  360. static void _addrexmatch(HSQUIRRELVM v,const SQChar *str,const SQChar *begin,const SQChar *end)
  361. {
  362. sq_newtable(v);
  363. sq_pushstring(v,_SC("begin"),-1);
  364. sq_pushinteger(v,begin - str);
  365. sq_rawset(v,-3);
  366. sq_pushstring(v,_SC("end"),-1);
  367. sq_pushinteger(v,end - str);
  368. sq_rawset(v,-3);
  369. }
  370. static SQRESULT _regexp_search(HSQUIRRELVM v)
  371. {
  372. SETUP_REX(v);
  373. const SQChar *str,*begin,*end;
  374. SQInteger start = 0;
  375. sq_getstring(v,2,&str);
  376. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  377. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  378. _addrexmatch(v,str,begin,end);
  379. return 1;
  380. }
  381. return 0;
  382. }
  383. static SQRESULT _regexp_capture(HSQUIRRELVM v)
  384. {
  385. SETUP_REX(v);
  386. const SQChar *str,*begin,*end;
  387. SQInteger start = 0;
  388. sq_getstring(v,2,&str);
  389. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  390. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  391. SQInteger n = sqstd_rex_getsubexpcount(self);
  392. SQRexMatch match;
  393. sq_newarray(v,0);
  394. for(SQInteger i = 0;i < n; i++) {
  395. sqstd_rex_getsubexp(self,i,&match);
  396. if(match.len > 0)
  397. _addrexmatch(v,str,match.begin,match.begin+match.len);
  398. else
  399. _addrexmatch(v,str,str,str); //empty match
  400. sq_arrayappend(v,-2);
  401. }
  402. return 1;
  403. }
  404. return 0;
  405. }
  406. static SQRESULT _regexp_xcapture(HSQUIRRELVM v)
  407. {
  408. SETUP_REX(v);
  409. const SQChar *str,*begin,*end;
  410. SQInteger start = 0;
  411. sq_getstring(v,2,&str);
  412. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  413. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  414. sq_pushbool(v, SQTrue);
  415. return 1;
  416. }
  417. return 0;
  418. }
  419. static SQRESULT _regexp_getxcapture(HSQUIRRELVM v)
  420. {
  421. SETUP_REX(v);
  422. SQInteger n, start;
  423. const SQChar *str;
  424. sq_getstring(v,2,&str);
  425. sq_getinteger(v,3,&n);
  426. SQRexMatch match;
  427. sqstd_rex_getsubexp(self,n,&match);
  428. if(match.len > 0){
  429. start = match.begin-str;
  430. sq_pushinteger(v, start);
  431. sq_arrayappend(v,-2);
  432. sq_pushinteger(v, start+match.len);
  433. sq_arrayappend(v,-2);
  434. sq_pushbool(v, SQTrue);
  435. return 1;
  436. }
  437. return 0;
  438. }
  439. static SQRESULT _regexp_subexpcount(HSQUIRRELVM v)
  440. {
  441. SETUP_REX(v);
  442. sq_pushinteger(v,sqstd_rex_getsubexpcount(self));
  443. return 1;
  444. }
  445. static SQRESULT _regexp_constructor(HSQUIRRELVM v)
  446. {
  447. const SQChar *error,*pattern;
  448. sq_getstring(v,2,&pattern);
  449. SQRex *rex = sqstd_rex_compile(pattern,&error);
  450. if(!rex) return sq_throwerror(v,error);
  451. sq_setinstanceup(v,1,rex);
  452. sq_setreleasehook(v,1,_rexobj_releasehook);
  453. return 0;
  454. }
  455. static SQRESULT _regexp__typeof(HSQUIRRELVM v)
  456. {
  457. sq_pushstring(v,_SC("regexp"),-1);
  458. return 1;
  459. }
  460. #define _DECL_REX_FUNC(name,nparams,pmask) {_SC(#name),_regexp_##name,nparams,pmask}
  461. static SQRegFunction rexobj_funcs[]={
  462. _DECL_REX_FUNC(constructor,2,_SC(".s")),
  463. _DECL_REX_FUNC(search,-2,_SC("xsn")),
  464. _DECL_REX_FUNC(match,2,_SC("xs")),
  465. _DECL_REX_FUNC(gmatch,3,_SC("xsc")),
  466. _DECL_REX_FUNC(gsub,3,_SC("xs c|a|t")),
  467. _DECL_REX_FUNC(capture,-2,_SC("xsn")),
  468. _DECL_REX_FUNC(xcapture,-2,_SC("xsn")),
  469. _DECL_REX_FUNC(getxcapture,4,_SC("xsna")),
  470. _DECL_REX_FUNC(subexpcount,1,_SC("x")),
  471. _DECL_REX_FUNC(_typeof,1,_SC("x")),
  472. {0,0}
  473. };
  474. #undef _DECL_REX_FUNC
  475. #define _DECL_FUNC(name,nparams,pmask) {_SC(#name),_string_##name,nparams,pmask}
  476. static SQRegFunction stringlib_funcs[]={
  477. _DECL_FUNC(printf,-2,_SC(".s")),
  478. _DECL_FUNC(format,-2,_SC(".s")),
  479. {0,0}
  480. };
  481. #undef _DECL_FUNC
  482. SQInteger sqstd_register_stringlib(HSQUIRRELVM v)
  483. {
  484. sq_pushstring(v,_SC("regexp"),-1);
  485. sq_newclass(v,SQFalse);
  486. SQInteger i = 0;
  487. while(rexobj_funcs[i].name != 0) {
  488. SQRegFunction &f = rexobj_funcs[i];
  489. sq_pushstring(v,f.name,-1);
  490. sq_newclosure(v,f.f,0);
  491. sq_setparamscheck(v,f.nparamscheck,f.typemask);
  492. sq_setnativeclosurename(v,-1,f.name);
  493. sq_newslot(v,-3,SQFalse);
  494. i++;
  495. }
  496. sq_newslot(v,-3,SQFalse);
  497. i = 0;
  498. while(stringlib_funcs[i].name!=0)
  499. {
  500. sq_pushstring(v,stringlib_funcs[i].name,-1);
  501. sq_newclosure(v,stringlib_funcs[i].f,0);
  502. sq_setparamscheck(v,stringlib_funcs[i].nparamscheck,stringlib_funcs[i].typemask);
  503. sq_setnativeclosurename(v,-1,stringlib_funcs[i].name);
  504. sq_newslot(v,-3,SQFalse);
  505. i++;
  506. }
  507. return 1;
  508. }